Improvement heuristics for the vehicle routing problem based on simulated annealing
From MaRDI portal
Publication:1390235
DOI10.1016/0377-2217(94)00064-JzbMath0914.90107OpenAlexW2074709462WikidataQ127212310 ScholiaQ127212310MaRDI QIDQ1390235
Publication date: 5 May 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00064-j
Related Items (25)
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits ⋮ An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup ⋮ Multi-ant colony system (MACS) for a vehicle routing problem with backhauls ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ Routing problems: A bibliography ⋮ A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost ⋮ Metaheuristics: A bibliography ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location ⋮ Design of an IT-driven decision support system for vehicle routing and scheduling. ⋮ A heuristic algorithm for solving hazardous materials distribution problems. ⋮ A simulated annealing heuristic for the team orienteering problem with time windows ⋮ An Investigation on Compound Neighborhoods for VRPTW ⋮ Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network ⋮ Solving the truck and trailer routing problem based on a simulated annealing heuristic ⋮ APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM ⋮ Comparing descent heuristics and metaheuristics for the vehicle routing problem ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS ⋮ The multiple shortest path problem with path deconfliction ⋮ A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows ⋮ A simulated annealing heuristic for the capacitated green vehicle routing problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
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
This page was built for publication: Improvement heuristics for the vehicle routing problem based on simulated annealing
