References
- BodinLGoldenBAssadABallMRouting and scheduling of vehicles and crews: the state of the artComput Opns Res1983106321110.1016/0305-0548(83)90030-8
- BrandãoJA tabu search heuristic algorithm for open vehicle routing problemEur J Opl Res200415755256410.1016/S0377-2217(03)00238-8
- ClarkeGWrightJWScheduling of vehicles from a central depot to a number of delivery pointsOpns Res19641256858110.1287/opre.12.4.568
- DesrochersMLaporteGImprovements and extensions to the Miller–Tucker–Zemlin subtour elimination constraintsOper Res Lett199110273610.1016/0167-6377(91)90083-2
- FuZEgleseRLiLYOA new tabu search heuristic for the open vehicle routing problemJ Opl Res Soc20055626727410.1057/palgrave.jors.2601817
- FuZEgleseRLiLYOCorrigendum to the paper ‘A new tabu search heuristic for the open vehicle routing problem'J Opl Res Soc2006571017101810.1057/palgrave.jors.2602181
- KaraİLaporteGBektasTA note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problemEur J Opl Res200415879379510.1016/S0377-2217(03)00377-1
- Letchford E, Lysgaard J and Eglese RW (2006). A branch-and-cut algorithm for the capacitated open vehicle routing problem .Working paper. Available online.
- LiLFuZThe school bus routing problem: A case studyJ Opl Res Soc20025355255810.1057/palgrave.jors.2601341
- Li F, Golden B and Wasil E (2006). The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Opl Res, to appear, available online doi:10.1016/j.cor.2005.11.018.
- Pisinger D and Ropke S (2006). A general heuristic for vehicle routing problems.Comput Opl Res, to appear, available online doi:10.1016/j.cor.2005.09.012.
- ReineltGThe Traveling Salesman: Computational Solutions for TSP Applications1991
- RochatYTaillardEDProbabilistic diversification and intensification in local search for vehicle routingJ Heuristics1995114716710.1007/BF02430370
- SariklisDPowellSA heuristic method for the open vehicle routing problemJ Opl Res Soc20005156457310.1057/palgrave.jors.2600924
- SchrageLFormulation and structure of more complex/realistic routing and scheduling problemsNetworks19811122923210.1002/net.3230110212
- TarantilisCDKiranoudisCTDistribution of fresh meatJ Food Eng200251859110.1016/S0260-8774(01)00040-1
- TarantilisCDDiakoulakiDKiranoudisCTCombination of geographical information system and efficient routing algorithms for real life distribution operationsEur J Opl Res200415243745310.1016/S0377-2217(03)00035-3
- TarantilisCDIoannouGKiranoudisCTPrastacosGPSolving the open vehicle routing problem via a single parameter meta-heuristic algorithmJ Opl Res Soc20055658859610.1057/palgrave.jors.2601848
- Van Breedam A (1994). An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints. PhD thesis, University of Antwerp.