Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints
This paper considers the dynamic vehicle routing problem where a fleet of vehicles deals with periodic deliveries of goods or services to spatially dispersed customers over a given time horizon. Individual customers may only be served by predefined (dedicated) suppliers. Each vehicle follows a pre-p...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-12-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/10/24/8872 |
| _version_ | 1797545009188175872 |
|---|---|
| author | Grzegorz Bocewicz Peter Nielsen Małgorzata Jasiulewicz-Kaczmarek Zbigniew Banaszak |
| author_facet | Grzegorz Bocewicz Peter Nielsen Małgorzata Jasiulewicz-Kaczmarek Zbigniew Banaszak |
| author_sort | Grzegorz Bocewicz |
| collection | DOAJ |
| description | This paper considers the dynamic vehicle routing problem where a fleet of vehicles deals with periodic deliveries of goods or services to spatially dispersed customers over a given time horizon. Individual customers may only be served by predefined (dedicated) suppliers. Each vehicle follows a pre-planned separate route linking points defined by the customer location and service periods when ordered deliveries are carried out. Customer order specifications and their services time windows as well as vehicle travel times are dynamically recognized over time. The objective is to maximize a number of newly introduced or modified requests, being submitted dynamically throughout the assumed time horizon, but not compromising already considered orders. Therefore, the main question is whether a newly reported delivery request or currently modified/corrected one can be accepted or not. The considered problem arises, for example, in systems in which garbage collection or DHL parcel deliveries as well as preventive maintenance requests are scheduled and implemented according to a cyclically repeating sequence. It is formulated as a constraint satisfaction problem implementing the ordered fuzzy number formalism enabling to handle the fuzzy nature of variables through an algebraic approach. Computational results show that the proposed solution outperforms commonly used computer simulation methods. |
| first_indexed | 2024-03-10T14:08:41Z |
| format | Article |
| id | doaj.art-4341339aeef04fca921586855e8f4738 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-10T14:08:41Z |
| publishDate | 2020-12-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-4341339aeef04fca921586855e8f47382023-11-21T00:22:26ZengMDPI AGApplied Sciences2076-34172020-12-011024887210.3390/app10248872Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty ConstraintsGrzegorz Bocewicz0Peter Nielsen1Małgorzata Jasiulewicz-Kaczmarek2Zbigniew Banaszak3Faculty of Electronics and Computer Science, Koszalin University of Technology, 75-453 Koszalin, PolandDepartment of Materials and Production, Aalborg University, DK-9100 Aalborg, DenmarkFaculty of Engineering Management, Poznan University of Technology, 60-965 Poznań, PolandFaculty of Electronics and Computer Science, Koszalin University of Technology, 75-453 Koszalin, PolandThis paper considers the dynamic vehicle routing problem where a fleet of vehicles deals with periodic deliveries of goods or services to spatially dispersed customers over a given time horizon. Individual customers may only be served by predefined (dedicated) suppliers. Each vehicle follows a pre-planned separate route linking points defined by the customer location and service periods when ordered deliveries are carried out. Customer order specifications and their services time windows as well as vehicle travel times are dynamically recognized over time. The objective is to maximize a number of newly introduced or modified requests, being submitted dynamically throughout the assumed time horizon, but not compromising already considered orders. Therefore, the main question is whether a newly reported delivery request or currently modified/corrected one can be accepted or not. The considered problem arises, for example, in systems in which garbage collection or DHL parcel deliveries as well as preventive maintenance requests are scheduled and implemented according to a cyclically repeating sequence. It is formulated as a constraint satisfaction problem implementing the ordered fuzzy number formalism enabling to handle the fuzzy nature of variables through an algebraic approach. Computational results show that the proposed solution outperforms commonly used computer simulation methods.https://www.mdpi.com/2076-3417/10/24/8872dynamic vehicle routing problemordered fuzzy numbers formalismdeclarative modellingservice delivery management |
| spellingShingle | Grzegorz Bocewicz Peter Nielsen Małgorzata Jasiulewicz-Kaczmarek Zbigniew Banaszak Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints Applied Sciences dynamic vehicle routing problem ordered fuzzy numbers formalism declarative modelling service delivery management |
| title | Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints |
| title_full | Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints |
| title_fullStr | Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints |
| title_full_unstemmed | Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints |
| title_short | Dynamic Planning of Mobile Service Teams’ Mission Subject to Orders Uncertainty Constraints |
| title_sort | dynamic planning of mobile service teams mission subject to orders uncertainty constraints |
| topic | dynamic vehicle routing problem ordered fuzzy numbers formalism declarative modelling service delivery management |
| url | https://www.mdpi.com/2076-3417/10/24/8872 |
| work_keys_str_mv | AT grzegorzbocewicz dynamicplanningofmobileserviceteamsmissionsubjecttoordersuncertaintyconstraints AT peternielsen dynamicplanningofmobileserviceteamsmissionsubjecttoordersuncertaintyconstraints AT małgorzatajasiulewiczkaczmarek dynamicplanningofmobileserviceteamsmissionsubjecttoordersuncertaintyconstraints AT zbigniewbanaszak dynamicplanningofmobileserviceteamsmissionsubjecttoordersuncertaintyconstraints |