Fresh seafood delivery routing problem using an improved ant colony optimization

DOI10.1007/S10479-017-2531-2zbMath1411.90348OpenAlexW2618766855MaRDI QIDQ1730650

Xianqiang Yang

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2531-2

zbMATH Keywords

ant colony optimizationmulti-depotdelivery routing problemenergy costfresh seafood

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (1)

TLHSA and SACA: two heuristic algorithms for two variant VRP models

Cites Work

• Unnamed Item
• Unnamed Item
• The petrol station replenishment problem with time windows
• The periodic vehicle routing problem with intermediate facilities
• Heuristic solutions to multi-depot location-routing problems
• An improved ant system algorithm for the vehicle routing problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• An improved ant colony optimization for vehicle routing problem
• Optimal product design using a colony of virtual ants
• Implicit depot assignments and rotations in vehicle routing heuristics
• Ant colonies for the quadratic assignment problem
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A Method for Solving Traveling-Salesman Problems

This page was built for publication: Fresh seafood delivery routing problem using an improved ant colony optimization