Pages that link to "Item:Q2367384"
From MaRDI portal
The following pages link to A parallel route building algorithm for the vehicle routing and scheduling problem with time windows (Q2367384):
Displaying 50 items.
- A two-stage solution method for the annual dairy transportation problem (Q322617) (← links)
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
- Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
- The dial-A-ride problem with transfers (Q336745) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← links)
- An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem (Q342549) (← links)
- A parallel matheuristic for the technician routing and scheduling problem (Q375996) (← links)
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Managing customer arrivals with time windows: a case of truck arrivals at a congested container terminal (Q512938) (← links)
- Implementing an insertion heuristic for vehicle routing on parallel hardware (Q690016) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- A general heuristic for vehicle routing problems (Q869003) (← links)
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- A heuristic algorithm for solving hazardous materials distribution problems. (Q1412759) (← links)
- A parametric analysis of heuristics for the vehicle routing problem with side-constraints (Q1600842) (← links)
- Vehicle routing with cross-dock selection (Q1652043) (← links)
- The periodic supply vessel planning problem with flexible departure times and coupled vessels (Q1652603) (← links)
- A metaheuristic for the time-dependent pollution-routing problem (Q1751914) (← links)
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
- Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
- A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
- Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Simulated annealing metaheuristics for the vehicle routing problem with time windows (Q1919832) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
- The multiple shortest path problem with path deconfliction (Q2030451) (← links)
- A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
- The vehicle routing problem with load-dependent travel times for cargo bicycles (Q2116921) (← links)
- Relief aid provision to en route refugees: multi-period mobile facility location with mobile demand (Q2140220) (← links)
- Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
- Branch-and-price for a multi-attribute technician routing and scheduling problem (Q2226497) (← links)
- Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm (Q2240047) (← links)
- The consultation timetabling problem at Danish high schools (Q2359151) (← links)
- Using cost change estimates in a local search heuristic for the pollution routing problem (Q2362177) (← links)
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
- Collaborative transportation planning of less-than-truckload freight (Q2454368) (← links)
- Fast and high precision algorithms for optimization in large-scale genomic problems (Q2490543) (← links)
- Waste collection vehicle routing problem with time windows (Q2496063) (← links)
- An iterated local search algorithm for the vehicle routing problem with backhauls (Q2514876) (← links)
- Heuristic approaches to vehicle routing with backhauls and time windows (Q2564754) (← links)
- Ensuring service levels in routing problems with time windows and stochastic travel times (Q2629660) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- A metaheuristic based on tabu search for solving a technician routing and scheduling problem (Q2664434) (← links)
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics (Q2672119) (← links)
