Pages that link to "Item:Q2029965"
From MaRDI portal
The following pages link to Multi-trip time-dependent vehicle routing problem with time windows (Q2029965):
Displaying 24 items.
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
- An assign-and-route matheuristic for the time-dependent inventory routing problem (Q2116930) (← links)
- The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- The multiple TSP with time windows: vehicle bounds based on precedence graphs (Q2583718) (← links)
- Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows (Q2627694) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- (Q3090695) (← links)
- Multi-trip vehicle routing problem with order release time (Q5059403) (← links)
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization (Q6073272) (← links)
- Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit (Q6087499) (← links)
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints (Q6106775) (← links)
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)
- QMOEA: a Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows (Q6195430) (← links)
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization (Q6568433) (← links)
- An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows (Q6572891) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
- Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens (Q6609700) (← links)