Timing problems and algorithms: time decisions for sequences of activities

DOI10.1002/NET.21587MaRDI QIDQ4642457zbMATH OpenOpenAlexFDO

Authors T. Vidal, Teodor Gabriel Crainic, Michel Gendreau, Christian Prins

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21587

zbMATH Keywords

branch and boundneighborhood searchoptimizationresource allocationroutingschedulingstatistical inferencetiming

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art
• scientific article; zbMATH DE number 4047423
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Recent progress of local search in handling the time window constraints of the vehicle routing problem
• Time-dependent routing

Cited in

(23)

• Bi-objective orienteering for personal activity scheduling
• Heuristics for vehicle routing problems: sequence or set optimization?
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation
• The job shop scheduling problem with convex costs
• Routing a mix of conventional, plug-in hybrid, and electric vehicles
• Scheduling activities with time-dependent durations and resource consumptions
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
• A concise guide to existing and emerging vehicle routing problem variants
• The vehicle routing problem with arrival time diversification on a multigraph
• Industrial and tramp ship routing problems: closing the gap for real-scale instances
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• A noncompact formulation for job-shop scheduling problems in traffic management
• The Vehicle Routing Problem with Release and Due Dates
• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
• Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
• Graph representation of the fixed route dial-a-ride problem
• A ride time-oriented scheduling algorithm for dial-a-ride problems
• Single machine rescheduling for new orders with maximum and total time disruption constraints
• Assigning airport ground handling operations: a data-driven matheuristic
• A review of recent advances in time-dependent vehicle routing
• An efficient timing algorithm for drivers with rest periods

This page was built for publication: Timing problems and algorithms: time decisions for sequences of activities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642457)