Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
From MaRDI portal
Publication:3076017
DOI10.1002/NET.20383zbMATH Open1205.90053OpenAlexW2038039225MaRDI QIDQ3076017FDOQ3076017
Recommendations
- Optimizing time–cost trade-off decisions in an interval transportation problem with multiple shipment options
- Multimodal freight transportation planning: a literature review
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- The optimization of transportation costs in logistics enterprises with time-window constraints
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- 0-1 reformulations of the multicommodity capacitated network design problem
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- Best routes selection in international intermodal networks
- Column Generation
- Delivery itineraries and distribution capacity of a freight network with time slots
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- Models for representing piecewise linear cost functions
- New formulation and relaxation to solve a concave-cost network flow problem
- Opportunities for OR in intermodal freight transport research: A review.
- Planning models for freight transportation
- Service network design in freight transportation
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The vehicle routing problem
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Cited in
(23)- Real-time control of freight forwarder transportation networks by integrating multimodal transport chains
- A simulated multi-objective model for flexible job shop transportation scheduling
- Logic-based benders decomposition for an inter-modal transportation problem
- scientific article; zbMATH DE number 7071803 (Why is no real title available?)
- Optimizing time–cost trade-off decisions in an interval transportation problem with multiple shipment options
- A dynamic transportation model with multiple criteria and multiple constraint levels
- Mileage bands in freight transportation
- Freight consolidation with divisible shipments, delivery time windows, and piecewise transportation costs
- Combining linear programming and automated planning to solve intermodal transportation problems
- Operational Research in the Wine Supply Chain
- A capacity assessment approach for multi-modal transportation systems
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
- Best routes selection in multimodal networks using multi-objective genetic algorithm
- Models for the schedule optimization problem at a public transit terminal
- scientific article; zbMATH DE number 936861 (Why is no real title available?)
- Solution techniques for the inter-modal pickup and delivery problem in two regions
- A sequential reduction algorithm for the large-scale fixed-charge network flow problems
- Solving the multi-modal transportation problem via the rough interval approach
- An intermodal multicommodity routing problem with scheduled services
- A two-stage model for a day-ahead paratransit planning problem
- Colored-edge graph approach for the modeling of multimodal transportation systems
- A time-dependent fuzzy programming approach for the green multimodal routing problem with rail service capacity uncertainty and road traffic congestion
- Multimodal freight transportation planning: a literature review
This page was built for publication: Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3076017)
