Pages that link to "Item:Q2489298"

The following pages link to Sequential search and its application to vehicle-routing problems (Q2489298):

Displaying 25 items.

• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
• Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities (Q1722978) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• The vehicle routing problem with profits and consistency constraints (Q1755266) (← links)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
• High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows (Q1951171) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• Resource extension functions: properties, inversion, and generalization to segments (Q2480803) (← links)
• Solution of real-world postman problems (Q2482818) (← links)
• Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
• An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems (Q2668773) (← links)
• In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
• A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST (Q3013562) (← links)
• Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
• Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems (Q6153465) (← links)