An optimization approach for planning daily drayage operations

DOI10.1007/s10100-006-0165-6zbMath1203.90024OpenAlexW2039542671MaRDI QIDQ926343

Erick Wikum, Yetkin Ileri, Ted Gifford, Nemhauser, George I., Joel S. Sokol, Mokhtar S. Bazaraa

Publication date: 27 May 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-006-0165-6

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Rich vehicle routing problems: from a taxonomy to a definition, Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations, A novel approach for solving nonsmooth optimization problems with application to nonsmooth equations, A multiperiod drayage problem with customer-dependent service periods, On a nonsmooth vector optimization problem with generalized cone invexity, The multi-trip container drayage problem with synchronization for efficient empty containers re-usage, Integrated planning of loaded and empty container movements, Combined strip and discharge delivery of containers in heterogeneous fleets with time windows, A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem, A truck scheduling problem arising in intermodal container transportation

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• The pickup and delivery problem with time windows
• Opportunities for OR in intermodal freight transport research: A review.
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Drive: Dynamic Routing of Independent Vehicles
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A polyhedral study of the asymmetric traveling salesman problem with time windows