Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
From MaRDI portal
Publication:3202131
DOI10.1287/trsc.24.2.145zbMath0715.90066OpenAlexW2076564108MaRDI QIDQ3202131
François Soumis, Jacques Desrosiers, Yvan Dumas
Publication date: 1990
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.24.2.145
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (15)
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows ⋮ Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems ⋮ Graph representation of the fixed route dial-a-ride problem ⋮ Étude comparative de divers modèles pour le problème de transport à la demande ⋮ A rotation-based branch-and-price approach for the nurse scheduling problem ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ The dial-a-ride problem: Models and algorithms ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ Ship scheduling with soft time windows: An optimisation based approach ⋮ A meta-heuristic to solve the just-in-time job-shop scheduling problem ⋮ Multi-depot vehicle scheduling problems with time windows and waiting costs
This page was built for publication: Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
