Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints

DOI10.1016/j.ejor.2006.12.030zbMath1137.90336OpenAlexW2049434503MaRDI QIDQ2455613

Fernando Ordóñez, Maged M. Dessouky, Luca Quadrifoglio

Publication date: 25 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.030

zbMATH Keywords

integer programmingTransportationconstraints satisfaction

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Constraint programming and operations research ⋮ The share-a-ride problem: people and parcels sharing taxis ⋮ Valid inequalities for the synchronization bus timetabling problem ⋮ Vehicle routing and scheduling of flex-route transit under a dynamic operating environment ⋮ A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops ⋮ Public transport for smart cities: recent innovations and future challenges ⋮ Optimization for dynamic ride-sharing: a review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Strong formulations for mixed integer programming: A survey
• The pickup and delivery problem with time windows
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Model tightening for integrated timber harvest and transportation planning
• A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• The General Pickup and Delivery Problem

This page was built for publication: Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints