A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
From MaRDI portal
Publication:1806612
DOI10.1016/S0377-2217(98)00315-4zbMath0945.90007MaRDI QIDQ1806612
Fuh-Hwa Franklin Liu, Sheng-Yuan Shen
Publication date: 29 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (16)
Routing relatively few customers per route ⋮ A parallel hybrid genetic algorithm for the vehicle routing problem with time windows ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ An adaptive evolutionary approach for real-time vehicle routing and dispatching ⋮ Optimal routing of multimodal mobility systems with ride‐sharing ⋮ A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows ⋮ Towards a decision support system for the ready concrete distribution system: a case of a Greek company. ⋮ A TABU search heuristic for the team orienteering problem ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ A two-phase hybrid metaheuristic for the vehicle routing problem with time windows ⋮ A Hybrid Genetic Approach for the Dynamic Vehicle Routing Problem with Time Windows ⋮ A mixed constrained (identical) vehicle routing problem for time minimisation ⋮ A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework ⋮ A hybrid evolution strategy for the open vehicle routing problem ⋮ An evolutionary approach for the target search problem in uncertain environment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- Vehicle Routing with Time Windows
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Vehicle Routing with Time Windows: Two Optimization Algorithms
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
This page was built for publication: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
