Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking

DOI10.1016/j.apm.2016.06.013zbMath1480.90074OpenAlexW2474404500MaRDI QIDQ2293789

Peng-Yeng Yin, Ya-Lan Chuang

Publication date: 5 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2016.06.013

zbMATH Keywords

vehicle routingartificial bee colony algorithmgreen supply chain managementcross-dockingadaptive memory programing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (9)

A path-based solution approach for the green vehicle routing problem ⋮ Rapid parameter identification of linear time-delay system from noisy frequency domain data ⋮ The rendezvous vehicle routing problem ⋮ Cross-dock facility for disaster relief operations ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ Presenting an optimization model for multi cross-docking rescheduling location problem with metaheuristic algorithms ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Self-tuning cross-coupled two degree-of-freedom PID control for position synchronization of dual linear motors

Uses Software

• CLOVES
• Scatter Search
• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
• Reverse logistics: simultaneous design of delivery routes and returns strategies
• CLOVES: a cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up
• The \(p\)-median problem: a survey of metaheuristic approaches
• Comparing backhauling strategies in vehicle routing using ant colony optimization
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• An effective and fast heuristic for the dial-a-ride problem
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• The single‐vehicle routing problem with unrestricted backhauls
• A GRASP for the Vehicle Routing Problem with Time Windows
• Vehicle routing with cross-docking

This page was built for publication: Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking