Pages that link to "Item:Q4355334"

The following pages link to A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows (Q4355334):

Displaying 50 items.

• Vehicle routing-scheduling for waste collection in Hanoi (Q1582030) (← links)
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls (Q1607978) (← links)
• Visual attractiveness in routing problems: a review (Q1634050) (← links)
• The electric two-echelon vehicle routing problem (Q1634075) (← links)
• A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain (Q1637720) (← links)
• A novel model for the time dependent competitive vehicle routing problem: modified random topology particle swarm optimization (Q1654574) (← links)
• A two-phase heuristic algorithm for the common frequency routing problem with vehicle type choice in the milk run (Q1665593) (← links)
• Appointment scheduling and routing optimization of attended home delivery system with random customer behavior (Q1683134) (← links)
• Multi-trip pickup and delivery problem with time windows and synchronization (Q1695786) (← links)
• Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time (Q1718618) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• Minimizing the maximal ergonomic burden in intra-hospital patient transportation (Q1734337) (← links)
• What makes a VRP solution good? The generation of problem-specific knowledge for heuristics (Q1734855) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• Vehicle routing problem for multiple product types, compartments, and trips with soft time windows (Q1751334) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• A time-based pheromone approach for the ant system (Q1758053) (← links)
• A TABU search heuristic for the team orienteering problem (Q1764755) (← links)
• Active guided evolution strategies for large-scale vehicle routing problems with time windows (Q1764768) (← links)
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← 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)
• On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
• Vehicle dispatching with time-dependent travel times (Q1869392) (← links)
• Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows (Q1879791) (← links)
• A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
• Coupling ant colony systems with strong local searches (Q1926808) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction (Q1955318) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
• Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints (Q2005939) (← links)
• A computational tool for optimizing the urban public transport: A real application (Q2017562) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem (Q2023966) (← links)
• Tabu search for the time-dependent vehicle routing problem with time windows on a road network (Q2028848) (← links)
• Time-dependent stochastic vehicle routing problem with random requests: application to online police patrol management in Brussels (Q2030456) (← links)
• Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows (Q2214966) (← links)
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm (Q2240047) (← links)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
• A tabu search heuristic for the dynamic transportation of patients between care units (Q2275836) (← links)
• Dynamic vehicle routing with time windows in theory and practice (Q2311301) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows (Q2356205) (← links)