A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search

DOI10.3934/jimo.2012.8.469zbMath1364.90374OpenAlexW2332090511MaRDI QIDQ2358876

Mingyong Lai, Xiaojiao Tong

Publication date: 16 June 2017

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2012.8.469

zbMATH Keywords

vehicle routing problemtime window constraintsimproved ant colony optimizationimproved tabu searchsimultaneous pickups and deliveries

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents, Bi-objective blood product scheduling under blood shortage and limited supply, Humanitarian logistics planning for natural disaster response with Bayesian information updates

Cites Work

• Unnamed Item
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• Reverse logistics: simultaneous design of delivery routes and returns strategies
• A two-stage hybrid meta-heuristic for pickup and delivery vehicle routing problem with time windows
• A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Algorithms on Strings, Trees and Sequences
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up