Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
From MaRDI portal
Publication:3076017
DOI10.1002/net.20383zbMath1205.90053OpenAlexW2038039225MaRDI QIDQ3076017
Gilbert Laporte, Maria Pia Valentini, Luigi Moccia, Stefan Ropke, Jean-François Cordeau
Publication date: 17 February 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20383
column generationtime windowsmultimodal transportationmulticommodity flow problemnonconvex piecewise linear cost functiontransportation timetable
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
Multimodal freight transportation planning: a literature review, Operational Research in the Wine Supply Chain, Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs, Best routes selection in multimodal networks using multi-objective genetic algorithm, Mileage bands in freight transportation, An intermodal multicommodity routing problem with scheduled services, A time-dependent fuzzy programming approach for the green multimodal routing problem with rail service capacity uncertainty and road traffic congestion, Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems, Solution techniques for the inter-modal pickup and delivery problem in two regions, Logic-based benders decomposition for an inter-modal transportation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Delivery itineraries and distribution capacity of a freight network with time slots
- 0-1 reformulations of the multicommodity capacitated network design problem
- Planning models for freight transportation
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Opportunities for OR in intermodal freight transport research: A review.
- Models for representing piecewise linear cost functions
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Service network design in freight transportation
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Best routes selection in international intermodal networks
- The Vehicle Routing Problem
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- New formulation and relaxation to solve a concave-cost network flow problem
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows
- Column Generation
