Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
3.5
2.4
Journals
Mathematics
Special Issues
Models and Algorithms for Vehicle Routing Problems with Synchronized Constraints
share announcement

Models and Algorithms for Vehicle Routing Problems with Synchronized Constraints

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Engineering Mathematics".

Deadline for manuscript submissions: 31 December 2024 | Viewed by 1215

Special Issue Editors

Dr. Faisal M Alkaabneh

E-Mail Website
Guest Editor
Department of Industrial & Systems Engineering, North Carolina Agricultural and Technical State University, Greensboro, NC, USA
Interests: industrial & systems engineering
Prof. Dr. Shih-Wei Lin

E-Mail Website
Guest Editor
Department of Information Management, Chang Gung University, Taoyuan 33302, Taiwan
Interests: applications of meta-heuristics; big data; data mining; scheduling; vehicle routing problems
Special Issues, Collections and Topics in MDPI journals
Prof. Dr. Vincent F. Yu

E-Mail Website
Guest Editor
Department of Industrial Management, National Taiwan University of Science and Technology, Keelung Road, Taipei 106, Taiwan
Interests: operations research; meta-heuristics logistics; vehicle routing problem; artificial intelligence

Special Issue Information

Dear Colleagues,

We invite you to submit your latest research in the application of vehicle routing problem with synchronization constraints (VRPSC) to the upcoming Special Issue of Mathematics entitled “Models and Algorithms for Vehicle Routing Problems with Synchronized Constraints”. The aim of the Issue is to expand the applicability of VRPSC mathematical models and algorithms for solving various types of problems in the areas of supply chain, military, city logistics, agriculture, etc. We also welcome any new applications of VRPSC and/or algorithms to solve large-scale instances of VRPSC. Additionally, research papers presenting solution methods, studying their computational complexity, and proposing new algorithms to solve VRPSC, in an effective and efficient manner, are also welcome. We are looking forward to receiving discussions of new applications and case studies, in real-world settings, of state-of-the art metaheuristics/algorithmic techniques to offer efficient solutions for complex VRPSC problems. Suitable papers will draw on address the suitability, validity, and advantages of utilizing VRPSC to treat real-life problems from various disciplines.

Dr. Faisal M Alkaabneh
Prof. Dr. Shih-Wei Lin
Prof. Dr. Vincent F. Yu
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • metaheuristics
  • vehicle routing
  • logistics
  • vehicle routing with syncronization constraints

Published Papers (1 paper)

Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

21 pages, 4527 KiB  
Article
Solving the Flying Sidekick Traveling Salesman Problem by a Simulated Annealing Heuristic
by Vincent F. Yu, Shih-Wei Lin, Panca Jodiawan and Yu-Chi Lai
Mathematics 2023, 11(20), 4305; https://doi.org/10.3390/math11204305 - 16 Oct 2023
Cited by 1 | Viewed by 980
Abstract
This study investigates the flying sidekick traveling salesman problem (FSTSP), in which a truck and an unmanned aerial vehicle work together to make deliveries. This study develops a revised mixed-integer linear programming (MILP) model for the FSTSP. The revised MILP model performs better [...] Read more.
This study investigates the flying sidekick traveling salesman problem (FSTSP), in which a truck and an unmanned aerial vehicle work together to make deliveries. This study develops a revised mixed-integer linear programming (MILP) model for the FSTSP. The revised MILP model performs better than the existing model. Due to the FSTSP’s high complexity, we propose an effective heuristic based on simulated annealing (SA) to solve the problem. The novelty of the proposed SA heuristic lies in the new solution representation, which not only determines the visiting sequence of customers but also the service type of customers and rendezvous positions. Another feature of the proposed SA is a new operator specifically designed for the FSTSP. To evaluate the performance of the proposed SA heuristic, we conduct a comprehensive computational study where we fine-tune the parameters of the SA heuristic and compare the performance of the SA heuristic with several state-of-the-art algorithms including hybrid genetic algorithm (HGA) and iterated local search (ILS) in solving existing FSTSP benchmark instances. The results indicate that the proposed SA heuristic outperforms ILS and is statistically competitive with HGA. It obtains best-known solutions for all small FSTSP instances and 29 best-known solutions for the 60 large FSTSP instances, including 20 new best-known solutions. Full article
(This article belongs to the Special Issue Models and Algorithms for Vehicle Routing Problems with Synchronized Constraints)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-1
Back to TopTop