Capacitated profitable tour problem with cross-docking

DOI10.1016/J.COR.2025.107077MaRDI QIDQ6974606zbMATH OpenFDO

Authors Pengfei He, Wenchong Chen, Qinghua Wu, Fengjun Xiao

Publication date 6 June 2025

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2025.107077

zbMATH Keywords

cross-dockingedge assembly crossoverhybrid genetic algorithmlocal searchprofitable tour problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut algorithm for the capacitated profitable tour problem
• A hybrid genetic algorithm for the Hamiltonian p‐median problem
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
• An efficient implementation of a static move descriptor-based local search heuristic
• An Exchange Heuristic for Routeing Problems with Time Windows
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood
• Integer Programming Formulation of Traveling Salesman Problems
• Memetic search for the minmax multiple traveling salesman problem with single and multiple depots
• Moving products between location pairs: cross-docking versus direct-shipping
• Optimal solutions for routing problems with profits
• The capacitated team orienteering and profitable tour problems
• The General Pickup and Delivery Problem
• The team orienteering problem
• Variable neighborhood search
• Vehicle routing with cross-docking

This page was built for publication: Capacitated profitable tour problem with cross-docking

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