A hybrid genetic algorithm for the multiple crossdocks problem
Summary: We study a multiple crossdocks problem with supplier and customer time windows, where any violation of time windows will incur a penalty cost and the flows through the crossdock are constrained by fixed transportation schedules and crossdock capacities. We prove this problem to be \(\mathcal{NP}\)-hard in the strong sense and therefore focus on developing efficient heuristics. Based on the problem structure, we propose a hybrid genetic algorithm (HGA) integrating greedy technique and variable neighborhood search method to solve the problem. Extensive experiments under different scenarios were conducted, and results show that HGA outperforms CPLEX solver, providing solutions in realistic timescales.
- A modified variable neighborhood search hybridized with genetic algorithm for vehicle routing problems with cross-docking
- A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem
- Crossdocking—JIT scheduling with time windows
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- Transshipment service through crossdocks with both soft and hard time windows
- A new decision rule for lateral transshipments in inventory systems
- A two-location inventory model with transshipment and local decision making
- Crossdocking—JIT scheduling with time windows
- Evaluation of unidirectional lateral transshipments and substitutions in inventory systems.
- Multiple crossdocks with inventory and time windows
- Optimal and Approximate Policies in Multiperiod, Multilocation Inventory Models with Transshipments
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
- Scheduling inbound and outbound trucks at cross docking terminals
- Sharing and lateral transshipment of inventory in a supply chain with expensive low-demand items
- The dynamic transshipment problem
- The Multilocation Multiperiod Inventory Problem: Bounds and Approximations
- The one-period, N-location distribution problem
- Transshipment through crossdocks with inventory and time windows
- Truck dock assignment problem with operational time constraint within crossdocks
- An analysis of an embedded crossover scheme on a GA-hard problem
- A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost
- Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks
- A hybrid crossover operator for structural optimisation based on commonality in genetic search
- Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems
This page was built for publication: A hybrid genetic algorithm for the multiple crossdocks problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1954652)
