IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v188y2008i1p85-100.html
   My bibliography  Save this article

Pareto optimal solutions of a cost-time trade-off bulk transportation problem

Author

Listed:
  • Prakash, Satya
  • Kumar, Pranav
  • Prasad, B.V.N.S.
  • Gupta, Anuj

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:188:y:2008:i:1:p:85-100
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00407-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. V. Srinivasan & G. L. Thompson, 1973. "An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems," Operations Research, INFORMS, vol. 21(1), pages 284-295, February.
    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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. 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.
    4. Sonia Singh & Shalabh Singh, 2018. "Bi-criteria transportation problem with multiple parameters," Annals of Operations Research, Springer, vol. 269(1), pages 667-692, October.

    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. T Öncan & S N Kabadi & K P K Nair & A P Punnen, 2008. "VLSN search algorithms for partitioning problems using matching neighbourhoods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 388-398, March.
    3. 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.
    4. 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.
    5. 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.
    6. Pisut Pongchairerks, 2023. "A Probabilistic Hill-Climbing Algorithm for the Single-Source Transportation Problem," Sustainability, MDPI, vol. 15(5), pages 1-14, February.
    7. 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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:188:y:2008:i:1:p:85-100. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.