IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v4y2003p9.html
   My bibliography  Save this article

Improved solutions for vehicle routing and scheduling with fuzzy time windows and fuzzy goal

Author

Listed:
  • Przemysław Kobylański
  • Michał Kulej

Abstract

In this paper, we consider a vehicle routing and scheduling problem with fuzzy time windows and a fuzzy goal. A two-stage method for obtaining the improved optimal solution to the problem under consideration is presented. This method uses the constraint programming as an effective tool for solving the problem.

Suggested Citation

  • Przemysław Kobylański & Michał Kulej, 2003. "Improved solutions for vehicle routing and scheduling with fuzzy time windows and fuzzy goal," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 13(4), pages 97-114.
    • Handle: RePEc:wut:journl:v:4:y:2003:p:9
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/2003410%20-%20published.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Marshall L. Fisher & Kurt O. Jörnsten & Oli B. G. Madsen, 1997. "Vehicle Routing with Time Windows: Two Optimization Algorithms," Operations Research, INFORMS, vol. 45(3), pages 488-492, June.
    2. Dubois, Didier & Fortemps, Philippe, 1999. "Computing improved optimal solutions to max-min flexible constraint satisfaction problems," European Journal of Operational Research, Elsevier, vol. 118(1), pages 95-126, October.
    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. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    2. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    3. Dias, Luis C. & Lamboray, Claude, 2010. "Extensions of the prudence principle to exploit a valued outranking relation," European Journal of Operational Research, Elsevier, vol. 201(3), pages 828-837, March.
    4. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    5. Kalaı¨, Rim & Lamboray, Claude & Vanderpooten, Daniel, 2012. "Lexicographic α-robustness: An alternative to min–max criteria," European Journal of Operational Research, Elsevier, vol. 220(3), pages 722-728.
    6. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    7. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    8. Shuangchi He & Melvyn Sim & Meilin Zhang, 2019. "Data-Driven Patient Scheduling in Emergency Departments: A Hybrid Robust-Stochastic Approach," Management Science, INFORMS, vol. 65(9), pages 4123-4140, September.
    9. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    10. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    11. Zhu, Bin & Xu, Zeshui, 2014. "Analytic hierarchy process-hesitant group decision making," European Journal of Operational Research, Elsevier, vol. 239(3), pages 794-801.
    12. Bo Sun & Ming Wei & Senlai Zhu, 2018. "Optimal Design of Demand-Responsive Feeder Transit Services with Passengers’ Multiple Time Windows and Satisfaction," Future Internet, MDPI, vol. 10(3), pages 1-15, March.
    13. Chung-Yee Lee & Sila Çetinkaya & Albert P.M. Wagelmans, 1999. "A Dynamic Lot-Sizing Model with Demand Time Windows," Tinbergen Institute Discussion Papers 99-095/4, Tinbergen Institute.
    14. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    15. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
    16. Bogdan Armaselu, 2023. "Approximation algorithms for some extensions of the maximum profit routing problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-22, January.
    17. Guillaume, Romain & Houé, Raymond & Grabot, Bernard, 2014. "Robust competence assessment for job assignment," European Journal of Operational Research, Elsevier, vol. 238(2), pages 630-644.
    18. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
    19. Han Zheng & Junhua Chen & Xingchen Zhang & Zixian Yang, 2019. "Designing a New Shuttle Service to Meet Large-Scale Instantaneous Peak Demands for Passenger Transportation in a Metropolitan Context: A Green, Low-Cost Mass Transport Option," Sustainability, MDPI, vol. 11(18), pages 1-28, September.
    20. Marielle Christiansen, 1999. "Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem," Transportation Science, INFORMS, vol. 33(1), pages 3-16, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:wut:journl:v:4:y:2003:p:9. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    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.