- BakerE. (1983). An exact algorithm for the time constrained traveling salesman problem. Operations Research, 31, 938–945.
- BakerE.; BodinL.; FinneganW.; and PonderR. (1979). Efficient heuristic solutions to an airline crew scheduling problem. AIIE Transactions, 11, 119–126.
- BellW.; DalbertoL.; FisherM.; GreenfieldA.; JaikumarR.; MackR.; and PrutzmanP. (1983). Improving the distribution of industrial gases with an on-line computerized routing and scheduling system. Interfaces, 13, 4–23.
- BodinL.; GoldenB.; AssadA.; and BallM. (1983). The routing and scheduling of vehicles and crews. Computers and Operations Research, 10, 63–211.
- ChristofidesN.; MingozziA.; and TothP. (1981). State-space relaxation procedures for the computation of bounds to routing problems. Networks. 11, 145–164.
- ChristofidesN.; MingozziA.; and TothP. (1979). The vehicle routing problem. In Combinatorial Optimization, ed. by ChristofidesN., MingozziA., TothP., and SardiC.. John Wiley & Sons, Inc. New York, pp.
- DesrosiersA; SoumisF.; and DesrochersM. (1983). Routing with time windows by column generation. Working paper 277, Centre de Reserche sur les Transports, University of Montreal, MontrealCanada.
- EilonS.; Watson-GandyC.; and ChristofidesN. (1971). Distribution Management. Griffin Press, London.
- GaskellT. (1967). Bases for vehicle fleet scheduling. Operational Research Quarterly, 18, 281–295.
- GoldenB.; MagnantiT.; and NguyenH. (1977). Implementing vehicle routing algorithms. Networks, 17, 113–148.
- FisherM.; GreenfieldA.; JaikumarR.; and KedioP. (October 1982). Real-time scheduling of a bulk delivery fleet: a practical application of Lagrangian relaxation. University of Pennsylvania Decision Sciences Working Paper.
- LenstraJ. and Rinnooy KanA. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11, 221–227.
- LinS. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44, 2245–2269.
- LinS. and KernighanB. (1973). An effective heuristic for the traveling salesman problem. Operations Research. 21, 498–516.
- MagnantiT. (1981). Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks, 11, 179–216.
- MillerC.; TuckerA.; and ZemlinR. (1960). Integer programming formulations and traveling salesman problems. Journal of the ACM, 7, 326–329.
- OrI. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Doctoral Dissertation, Northwestern University.
- PsaraftisH. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14, 130–154.
- PsaraftisH. (1983). K-interchange procedures for local search in a precedence-constrained routing problem. European Journal of Operational Research, 25, 517–524.
- RussellR. (1977). An effective heuristic for the m-tour traveling salesman problem with some side conditions. Operations Research, 25, 517–524.
- SextonT. (1979). The single vehicle many-to-many routing and scheduling problem. Ph.D. Thesis, SUNY at Stony Brook.
- SolomonM. (1983a). Vehicle routing and scheduling with time window constraints: models and algorithms. Working Paper 83–42, College of Business Administration, Northeastern University. Forthcoming in Operations Research..
- SolomonM. (1983b). On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints. Decision Sciences Working Paper 83–05-03, University of Pennsylvania. Forthcoming in Networks.
Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.