Pages that link to "Item:Q1926735"

The following pages link to A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem (Q1926735):

Displaying 32 items.

• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem (Q322620) (← links)
• Nested general variable neighborhood search for the periodic maintenance problem (Q322899) (← links)
• Two level general variable neighborhood search for attractive traveling salesman problem (Q337241) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698) (← links)
• A general variable neighborhood search variants for the travelling salesman problem with draft limits (Q1677289) (← links)
• General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits (Q1687637) (← links)
• Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
• Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem (Q1751783) (← links)
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
• Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
• Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
• A survey on the applications of variable neighborhood search algorithm in healthcare management (Q2240705) (← links)
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q2242245) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
• The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• Bike sharing systems: solving the static rebalancing problem (Q2445841) (← links)
• Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
• An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem (Q2664364) (← links)
• A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem (Q2675709) (← links)
• In memory of Professor Nenad Mladenović (1951--2022) (Q2677361) (← links)
• The multi-commodity pickup-and-delivery traveling salesman problem (Q2811323) (← links)
• Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region (Q5085994) (← links)
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)