Vehicle Routing with Pickup and Delivery: Heuristic and Metaheuristic Solution Algorithms,Used

Vehicle Routing with Pickup and Delivery: Heuristic and Metaheuristic Solution Algorithms,Used

In Stock
SKU: DADAX3659202584
Brand: LAP Lambert Academic Publishing
Condition: New
Regular price$129.11
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistics planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a customer location, pickup or a delivery. We considered two variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the Onecommodity Pickup and Delivery Problem (1PDP). We investigated heuristic and metaheuristic approaches for solving the selected PDP variants. Our research focuses on handling the difficult problem constraints in a simple and effective way. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighborhood moves. In general, the findings of the research indicate the success of our approach in devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed