A Lexi-Search Approach of Variant Vehicle Routing Problem
Main Article Content
Abstract
The present study addresses a variant of vehicle routing problem (VRP). Let there are n- nodes, among them a class of ni (<<n) nodes may act as source nodes for loading/reloading the goods and the rest of the nodes may require the goods which available at the source nodes. The requirement for the nodes is supplied through a vehicle, it has a finite capacity. The aim is to find an optimal trip schedule for the capacitated VRP which minimizes the total distance such that the vehicle has to traverse through a node exactly once according to the precedence relation and meet the requirements at the nodes. Here the precedence relation says that i<j, which means, before reaching the jth node, an ith node must covered in the trip schedule and it is not necessary that the jth node is an immediate successor. The problem often can be modeled as a zero-one programming problem. The problem is having a variety of applications in logistics, networking theory, routing and allied areas. To solve the proposed problem we planned to develop an exact algorithm called Lexi-Search Algorithm. For implementation of the algorithm we would like to develop a suitable code using C-Language.
Keywords: Vehicle Routing Problem, Precedence Relation, Lexi-Search Algorithm, Zero-One Programming. Hamiltonian Cycle, Re-loading nodes.
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.