Improvement heuristics for the vehicle routing problem based on simulated annealing
From MaRDI portal
Publication:1390235
DOI10.1016/0377-2217(94)00064-JzbMath0914.90107MaRDI QIDQ1390235
Publication date: 5 May 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B06: Transportation, logistics and supply chain management
Related Items
APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Solving the truck and trailer routing problem based on a simulated annealing heuristic, Design of an IT-driven decision support system for vehicle routing and scheduling., A heuristic algorithm for solving hazardous materials distribution problems., Routing problems: A bibliography, Metaheuristics: A bibliography, Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An improved annealing scheme for the QAP
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Simulated annealing: A tool for operational research
- An efficient implementation of local search algorithms for constrained routing problems
- A user's guide to tabu search
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Solving real-life vehicle routing problems efficiently using tabu search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Using simulated annealing to solve routing and location problems
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- Cooling Schedules for Optimal Annealing
- Simulated Annealing – An Annotated Bibliography
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Parallel Savings Based Heuristics for the Delivery Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Parallel iterative search methods for vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Equation of State Calculations by Fast Computing Machines
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
