Vehicle routing problem with weight coefficients
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A distribution network for one warehouse and multiple retailers is considered in this paper. The amount of vehicle is viewed upon as an operational variable without upper bound, which is known as flexible vehicle. According to whether the truck is full, different strategies are adopted, viz. direct shipment and peddling shipment. Using the peddling shipment strategy, a model named WVRP with weight coefficient is built. Distinguished from many other models, the demand of each retailer is also important factor to be considered when routing schedule is made. The retailers with larger demands have priority to be visited earlier. Finally, a genetic algorithm named PB- GA using a special partition method is proposed to solve this model, detailed comparison is made with usual heuristic for vehicle routing problem.[

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
You are the th visitor Address:Room 908, Building A, 25th Teaching Building, Tianjin University, 92 Weijin Road, Nankai District, Tianjin Postcode:300072
Telephone:022-27403197 Email:jmsc@tju.edu.cn