Hybrid adaptive memory programming to optimise the multi-commodity many to many vehicle routing problem

DOI10.1504/IJMOR.2020.110840zbMATH Open1482.90040OpenAlexW4243886649MaRDI QIDQ2247443FDOQ2247443

Authors: Jalel Euchi 

Publication date: 17 November 2021

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2020.110840

Recommendations

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem
• A hybrid metaheuristics approach for a multi-depot vehicle routing problem with simultaneous deliveries and pickups
• Adaptive memory programming for the vehicle routing problem with multiple trips

zbMATH Keywords

routingscatter searchpickup and deliveryadaptive memorymany to many

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cited In (3)

• An adaptive memory programming method for risk logistics operations
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer
• Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking

This page was built for publication: Hybrid adaptive memory programming to optimise the multi-commodity many to many vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247443)