The Solution of VRPPDTW Model with Service Cost Based on Genetic Algorithm

  • MA J
  • XIANG X
  • LIU P
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This paper combines with the traditional pick-up and delivery vehicle routing problem, in addition to consider the fixed cost and the variable cost and the penalty cost of violating the time window in the process of delivery, it add the service cost of the loading and unloading cargo. By calculating the proportion of the service cost and other parts of the cost to determine the weight of each part of the cost in the total cost. A model of vehicle routing problem with pick-up and delivery and time window (VRPPDTW) which includes the service cost is established. It designs rules to determine the adaptive crossover probability then basing on the genetic algorithm to solve the problem. Using the operator of select crossover and mutate to ensure the diversity of the population and using the elite strategy to ensure the stability of the population. At last, a numerical example is given to verify the model and the calculation method. As a result the genetic algorithm using adaptive rules to determine crossover probability is more suitable than SGA to solve this model. NR - 11 PU - DESTECH PUBLICATIONS, INC PI - LANCASTER PA - 439 DUKE STREET, LANCASTER, PA 17602-4967 USA

Cite

CITATION STYLE

APA

MA, J., XIANG, X., & LIU, P. (2017). The Solution of VRPPDTW Model with Service Cost Based on Genetic Algorithm. DEStech Transactions on Materials Science and Engineering, (mmme). https://doi.org/10.12783/dtmse/mmme2016/10151

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free