Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
DOI10.1016/J.APM.2016.06.013zbMATH Open1480.90074OpenAlexW2474404500MaRDI QIDQ2293789FDOQ2293789
Authors: 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
Recommendations
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- Solving the vehicle routing problem with adaptive memory programming methodology
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries
- Hybrid adaptive memory programming to optimise the multi-commodity many to many vehicle routing problem
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Adaptive memory programming for the vehicle routing problem with multiple trips
- Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal
vehicle routingartificial bee colony algorithmgreen supply chain managementcross-dockingadaptive memory programing
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- 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
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- Vehicle routing with cross-docking
- Reverse logistics: simultaneous design of delivery routes and returns strategies
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- Title not available (Why is that?)
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A GRASP for the Vehicle Routing Problem with Time Windows
- The single‐vehicle routing problem with unrestricted backhauls
- An effective and fast heuristic for the dial-a-ride problem
- A combined approach to solve the pickup and delivery selection problem
Cited In (10)
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Self-tuning cross-coupled two degree-of-freedom PID control for position synchronization of dual linear motors
- A path-based solution approach for the green vehicle routing problem
- Presenting an optimization model for multi cross-docking rescheduling location problem with metaheuristic algorithms
- The rendezvous vehicle routing problem
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
- Cross-dock facility for disaster relief operations
- Rapid parameter identification of linear time-delay system from noisy frequency domain data
Uses Software
This page was built for publication: Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293789)
