Optimization of Rich Vehicle Routing Problem Using Heuristic Algorithm

Optimization of Rich Vehicle Routing Problem Using Heuristic Algorithm


Marketed By :  Scholars' Press   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

₹ 4,090

Availability: Out of stock


Delivery :

5% Cashback on all Orders paid using MobiKwik Wallet T&C

Free Krispy Kreme Voucher on all Orders paid using UltraCash Wallet T&C
Product Out of Stock Subscription

(Notify me when this product is back in stock)

  • Product Description

This book is a comprehensive introduction to the design and development of heuristic algorithm that could be used for solving rich Vehicle Routing Problem (VRP). VRP relates to the problem of providing optimum service with a fleet of vehicles to customers. It is a combinatorial optimization problem. The objective is usually to maximize the profit of the operation. However, for public transportation owned and operated by government, accessibility takes priority over profitability. Accessibility usually reduces profit, while increasing profit tends to reduce accessibility. In this research, we look at how accessibility can be increased without penalizing the profitability. This requires the determination of routes with minimum fuel consumption, maximum number of ports of call and maximum load factor satisfying a number of pre-determined constraints, i.e. hard and soft constraints. The hard constraints are travel time, travel distance and the restriction that a route must contain at least one fuel port. Soft constraints concerns with ship draft and load factor.

Product Specifications
SKU :COC52901
Country of ManufactureIndia
Product BrandScholars' Press
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-06-08
0 Review(s)