An optimization algorithm for a capacitated vehicle routing problem with time windows
From MaRDI portal
Publication:2363743
DOI10.1007/s12046-016-0488-5zbMath1367.90010OpenAlexW2409138741MaRDI QIDQ2363743
Publication date: 26 July 2017
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://www.ias.ac.in/describe/article/sadh/041/05/0519-0529
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Maintenance scheduling in the electricity industry: a literature review
- An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
- ``Neural computation of decisions in optimization problems
- The vehicle routing problem: An overview of exact and approximate algorithms
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- The Truck Dispatching Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Neural networks and physical systems with emergent collective computational abilities.
This page was built for publication: An optimization algorithm for a capacitated vehicle routing problem with time windows