Optimal sequencing of skip collections and deliveries

Journal of the Operational Research Society

Volumn 48, Issue 1, 1997, Pages 57-64

  De Meulemeester, L ^a,c   Laporte, G ^b,c   Louveaux, F V ^a   Semet, F ^c  

^a UNIVERSITY OF NAMUR   (Belgium)

^b HEC MONTRÉAL   (Canada)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Branch and bound; Routing; Savings; Skips; Transportation problem; Vehicle

Indexed keywords

ALGORITHMS; CONTAINERS; COST EFFECTIVENESS; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; SCHEDULING; TRANSPORTATION ROUTES;

BRANCH AND BOUND; SAVINGS; SKIPS; TRANSPORTATION PROBLEM; VEHICLE ROUTING;

OPTIMIZATION;

EID: 0030712774     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600325     Document Type: Article

References (6)

1. Cristallo, G., (1994). Optimisation de tourne´es de ve´hicules detransport container. Me´moire de licence en Sciences Economiqueset Sociales, Faculte´s Universitaires Notre-Dame de laPaix, Namur, Belgium.
2. Clarke, G., Wright, J. W., (1964). Scheduling of vehicles from acentral depot to a number of delivery points, Opns Res 12:568-581.
3. Carpaneto, G., Toth, P., (1980). Some new branching andbounding criteria for the asymmetric traveling salesmanproblem, Mgmt Sci 26: 736-743.
4. Ahuja, R. K., Magnanti, T. L., Orlin, J. B., (1993). Network Flows.Prentice-Hall: Englewood Cliffs, NJ, 846 pp.
5. Syslo, M. M., Deo, N., Kowalik, J. S., (1983). Discrete OptimizationAlgorithms with PASCAL Programs. Prentice-Hall: EnglewoodCliffs, NJ, pp. 542.
6. Microsoft, Inc., AUTOROUTE EXPRESS EUROPE, Windows95 version. http://www.microsoft.con/catalog/.