Scholars Central

Research articlePublished 2013

The application of tabu search algorithm on split delivery open vehicle routing problem

Authors: Qiang Song, Lingxia Liu

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The traditional Open Vehicle Routing Problem (OVRP) assumes that the client’s demand can not be split and the type of vehicles is the same, but in the practical logistics distribution, the type of vehicles is not exactly the same, sometimes the transportation cost can be reduced by splitting the demand of clients to make the best of the loading capacity of vehicles. This paper proposes the SplitDeliveryOpenVehicle Routing Problemwith Heterogeneous Vehicles (SDOVRPHV) presents mathematic model with the integer programming, solves the problem with Tabu search algorithm and improves the generation of initial solution and neighborhood structure in the algorithm, By experiments, the effectiveness of model is validated, and the results are compared with the traditional OVRP which indicates that the algorithm can reduce effectively the transportation cost.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in BioTechnology: An Indian Journal.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalBioTechnology: An Indian Journal
  • SubjectBiochemistry & Biotechnology
  • BylineArticles whose byline prints “Qiang Song”
  • BylineArticles whose byline prints “Lingxia Liu”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels