Pages that link to "Item:Q4030786"

The following pages link to The Vehicle Routing Problem with Time Windows: Minimizing Route Duration (Q4030786):

Displaying 50 items.

• Vehicle routing with arrival time diversification (Q1711450) (← links)
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• A time-based pheromone approach for the ant system (Q1758053) (← links)
• The Canadian minimum duration truck driver scheduling problem (Q1761170) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• Solving routing problems with pairwise synchronization constraints (Q1787918) (← links)
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows (Q1806612) (← links)
• Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles (Q1999625) (← links)
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks (Q2011598) (← links)
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders (Q2029376) (← links)
• Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
• Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks (Q2030659) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
• The prisoner transportation problem (Q2178139) (← links)
• The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
• Minimising vehicle distribution duration considering service priority (Q2205078) (← links)
• The time-dependent vehicle routing problem with time windows and road-network information (Q2226499) (← links)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
• Design and operation for an electric taxi fleet (Q2260896) (← links)
• Recovery management for a dial-a-ride system with real-time disruptions (Q2327632) (← links)
• Waste collection inventory routing with non-stationary stochastic demands (Q2333149) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier (Q2422737) (← links)
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers (Q2450604) (← links)
• Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (Q2475859) (← links)
• The dial-a-ride problem: Models and algorithms (Q2480256) (← links)
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Variable neighborhood search for the dial-a-ride problem (Q2655965) (← links)
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery (Q2658463) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
• The vessel swap-body routing problem (Q2673585) (← links)
• Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
• Competition and Cooperation in Pickup and Multiple Delivery Problems (Q2980177) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• Local optimization of routes in vehicle routing problems with time windows (Q3497587) (← links)
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems (Q3564363) (← links)
• A polyhedral study of the asymmetric traveling salesman problem with time windows (Q4519128) (← links)
• Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
• Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows (Q5240195) (← links)
• New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
• Scheduling issues in vehicle routing (Q5963106) (← links)