IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v53y2016i4d10.1007_s12597-016-0259-4.html
   My bibliography  Save this article

Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized

Author

Listed:
  • Satya Prakash

    (Amity School of Engineering and Technology)

  • Anuj Gupta
  • Richa Garg

    (Amity School of Engineering and Technology)

  • Bhuvnesh Tanwar

    (Amity School of Engineering and Technology)

  • Deepika Kaushik

    (Amity School of Engineering and Technology)

  • Sourabh Aggarwal

    (Amity School of Engineering and Technology)

Abstract

A cost-time trade-off routing network problem is considered. In the network, each arc is associated with an ordered pair whose first component is the cost and the second component is the time of direct travel between two adjacent nodes. The cost-time trade-off routing network problem has two objectives without being prioritized. The objectives are to minimize the total cost and total time of travel between every two different nodes in the network. It is required to find all the Pareto optimal routes between every two different nodes in the network. An algorithm is developed for finding the set of Pareto optimal solutions providing all the optimal routes between every two different nodes in the network. The new algorithm extends Floyd’s algorithm, presently applicable only for solving the single-objective routing network problem, to solve the cost-time trade-off routing network problem, incorporating the concept of lexicographically lesser between two ordered pairs. The problem is solved in two phases. In the first phase, the cost-time trade-off routing network problem is represented by a square matrix whose rows and columns are equal to the number of nodes and whose entries are ordered pairs associated with the arcs in the network. In the second phase, the set of Pareto optimal solutions of the cost-time trade-off routing network problem is obtained through solving a sequence of prioritized bicriterion problems. The new algorithm is explained and is illustrated through solving a numerical example. Utility of the work is also indicated.

Suggested Citation

  • Satya Prakash & Anuj Gupta & Richa Garg & Bhuvnesh Tanwar & Deepika Kaushik & Sourabh Aggarwal, 2016. "Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 778-807, December.
    • Handle: RePEc:spr:opsear:v:53:y:2016:i:4:d:10.1007_s12597-016-0259-4
    DOI: 10.1007/s12597-016-0259-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-016-0259-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-016-0259-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Prakash, Satya & Kumar, Pranav & Prasad, B.V.N.S. & Gupta, Anuj, 2008. "Pareto optimal solutions of a cost-time trade-off bulk transportation problem," European Journal of Operational Research, Elsevier, vol. 188(1), pages 85-100, July.
    2. Prakash, Satya & Balaji, B. V. & Tuteja, Deepak, 1999. "Optimizing dead mileage in urban bus routes through a nondominated solution approach," European Journal of Operational Research, Elsevier, vol. 114(3), pages 465-473, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vigren, Andreas, 2020. "The Distance Factor in Swedish Bus Contracts How far are operators willing to go?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 132(C), pages 188-204.
    2. Yan, Shangyao & Chi, Chin-Jen & Tang, Ching-Hui, 2006. "Inter-city bus routing and timetable setting under stochastic demands," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(7), pages 572-586, August.
    3. Yan, Shangyao & Chen, Hao-Lei, 2002. "A scheduling model and a solution algorithm for inter-city bus carriers," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(9), pages 805-825, November.
    4. Sahin, Bahri & Yilmaz, Huseyin & Ust, Yasin & Guneri, Ali Fuat & Gulsun, BahadIr, 2009. "An approach for analysing transportation costs and a case study," European Journal of Operational Research, Elsevier, vol. 193(1), pages 1-11, February.
    5. Shangyao Yan & Ching-Hui Tang, 2008. "An Integrated Framework for Intercity Bus Scheduling Under Stochastic Bus Travel Times," Transportation Science, INFORMS, vol. 42(3), pages 318-335, August.
    6. Sanchita Sharma & Rita Malhotra & Shalini Arora, 2019. "Efficient triads related to transportation problem with common pivotal time," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 1353-1360, October.
    7. Prakash, Satya & Kumar, Pranav & Prasad, B.V.N.S. & Gupta, Anuj, 2008. "Pareto optimal solutions of a cost-time trade-off bulk transportation problem," European Journal of Operational Research, Elsevier, vol. 188(1), pages 85-100, July.
    8. Sonia Singh & Shalabh Singh, 2018. "Bi-criteria transportation problem with multiple parameters," Annals of Operations Research, Springer, vol. 269(1), pages 667-692, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:53:y:2016:i:4:d:10.1007_s12597-016-0259-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.