Result 1 to 20 of 99 total
A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. (English)
Eur. J. Oper. Res. 222, No. 3, 441-451 (2012).
1
Single-commodity network design with random edge capacities. (English)
Eur. J. Oper. Res. 220, No. 2, 394-403 (2012).
2
Designing the master schedule for demand-adaptive transit systems. (English)
Ann. Oper. Res. 194, 151-166 (2012).
3
A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. (English)
Oper. Res. 60, No. 3, 611-624 (2012).
4
Progressive hedging-based metaheuristics for stochastic network design. (English)
Networks 58, No. 2, 114-124 (2011).
5
Multi-start heuristics for the Two-Echelon Vehicle Routing Problem. (English)
Merz, Peter (ed.) et al., Evolutionary computation in combinatorial optimization. 11th European conference, EvoCOP 2011, Torino, Italy, April 27‒29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20363-3/pbk). Lecture Notes in Computer Science 6622, 179-190 (2011).
6
Efficient lower bounds and heuristics for the variable cost and size bin packing problem. (English)
Comput. Oper. Res. 38, No. 11, 1474-1482 (2011).
7
Branch and price for service network design with asset management constraints (English)
Transportation Science 45, No. 1, 33-49 (2011).
8
Efficient lower bounds and heuristics for the variable cost and size bin packing problem (English)
Computers & OR 38, No. 11, 1474-1482 (2011).
9
Multi-start heuristics for the two-echelon vehicle routing problem (English)
EvoCOP, 179-190 (2011).
10
An efficient metaheuristic for multi-dimensional multi-container packing (English)
CASE, 563-568 (2011).
11
Optimization motion for transportation systems planning. (English)
Paschos, Vangelis Th. (ed.), Combinatorial optimization. Volume 3: Applications of combinatorial optimization. London: ISTE; Hoboken, NJ: John Wiley \& Sons (ISBN 978-1-84821-149-0/hbk; 978-1-84821-146-9/set). 177-207 (2010).
12
Operations research and goods transportation. (English)
Paschos, Vangelis Th. (ed.), Combinatorial optimization. Volume 3: Applications of combinatorial optimization. London: ISTE; Hoboken, NJ: John Wiley \& Sons (ISBN 978-1-84821-149-0/hbk; 978-1-84821-146-9/set). 111-175 (2010).
13
Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints. (English)
Networks 55, No. 3, 171-180 (2010).
14
A metaheuristic for stochastic service network design. (English)
J. Heuristics 16, No. 5, 653-679 (2010).
15
A metaheuristic for a two echelon location-routing problem. (English)
Festa, Paola (ed.), Experimental algorithms. 9th international symposium, SEA 2010, Ischia Island, Naples, Italy, May 20‒22, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13192-9/pbk). Lecture Notes in Computer Science 6049, 288-301 (2010).
16
Comparaison de différentes formulations de conception de réseaux pour un problème de transport de fret avec gestion de véhicules (English)
Stud. Inform. Univ. 8, No. 2, 35-60 (2010).
17
Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design (English)
JORS 61, No. 3, 530-542 (2010).
18
A metaheuristic for a two echelon location-routing problem (English)
SEA, 288-301 (2010).
19
Service design models for rail intermodel transportation. (English)
Bertazzi, Luca (ed.) et al., Innovations in distribution logistics. Selected papers based on the presentations at the workshop IWDL 2006, Brescia, Italy, October 2006. Berlin: Springer (ISBN 978-3-540-92943-7/pbk; 978-3-540-92944-4/ebook). Lecture Notes in Economics and Mathematical Systems 619, 53-67 (2009).
20
Result 1 to 20 of 99 total
Start
Contact
Print
General Help
