-
1
-
-
0035424778
-
A unified tabu search heuristic for vehicle routing problems with time windows
-
J. F. Cordeau, G. Laporte, and A. Mercier, A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 200 I. 52(8): pp. 928-936.
-
(2001)
Journal of the Operational Research Society
, vol.52
, Issue.8
, pp. 928-936
-
-
Cordeau, J.F.1
Laporte, G.2
Mercier, A.3
-
2
-
-
0031146838
-
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
-
B. L. Golden, G. Laporte, and E. D. Taillard, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computers & Operations Research, 1997. 24(5): pp. 445-452.
-
(1997)
Computers & Operations Research
, vol.24
, Issue.5
, pp. 445-452
-
-
Golden, B.L.1
Laporte, G.2
Taillard, D.E.3
-
3
-
-
17144366640
-
A generalized insertion heuristic for the traveling salesman problem with time windows
-
M. Gendreau, et aI., A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Operations Research, 1998. 46(3): pp. 330-335.
-
(1998)
Operations Research
, vol.46
, Issue.3
, pp. 330-335
-
-
Gendreau, M.1
-
4
-
-
0000110116
-
Local search in routing problems with time windows
-
M. W. P. Savelsbergh, Local search in routing problems with time windows. Annals of Operations Research, 1985. 4(1): pp. 285-305.
-
(1985)
Annals of Operations Research
, vol.4
, Issue.1
, pp. 285-305
-
-
Savelsbergh, M.W.P.1
-
5
-
-
84881281065
-
Heuristic approaches for a special simultaneous pickUp and delivery problem with time windows in home health care industry
-
Bucharest, Roumania
-
R. Liu, X. Xie, V. Augusto, C. Rodriguez, Heuristic approaches for a special simultaneous pickUp and delivery problem with time windows in home health care industry. Proc. INCOM 2012, Bucharest, Roumania, 2012.
-
(2012)
Proc. INCOM 2012
-
-
Liu, R.1
Xie, X.2
Augusto, V.3
Rodriguez, C.4
-
6
-
-
33744818514
-
A branch-and-cut algorithm for the dial-a-ride problem
-
J. F. Cordeau, A Branch-and-Cut Algorithm for the Dial-a-Ride Problem. Operations Research, 2006. 54(3): pp. 573-586.
-
(2006)
Operations Research
, vol.54
, Issue.3
, pp. 573-586
-
-
Cordeau, J.F.1
-
7
-
-
79951556620
-
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
-
T. Garaix, et aI., Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Computers & Operations Research, 2011. 38(10): pp. 1435-1442.
-
(2011)
Computers & Operations Research
, vol.38
, Issue.10
, pp. 1435-1442
-
-
Garaix, T.1
-
8
-
-
0041194626
-
A tabu search heuristic for periodic and multi-depot vehicle routing problems
-
J. F. Cordeau, M. Gendreau, and G. Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 1997. 30(2): pp. 105-119.
-
(1997)
Networks
, vol.30
, Issue.2
, pp. 105-119
-
-
Cordeau, J.F.1
Gendreau, M.2
Laporte, G.3
-
9
-
-
0023313252
-
Algorithms for the vehicle routing and scheduling problems with time window constraints
-
M. M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 1987. 35(2): pp. 254-265.
-
(1987)
Operations Research
, vol.35
, Issue.2
, pp. 254-265
-
-
Solomon, M.M.1
|