Science AI Journal
Engineering · Research topic

Open research questions in Vehicle Routing Optimization Methods

70 gap statements mined from Vehicle Routing Optimization Methods papers in our 4.5M-paper local library, which holds 1,293 papers on the topic — drawn mostly from each paper's own stated research gap, future-work, challenge and limitation notes, and its abstract. The ones listed below are a selection still marked open; each names the study that raised it, with a DOI link where the paper has one.

Choosing where to publish on Vehicle Routing Optimization Methods? See the ranked Engineering journals.

What the literature leaves open

  • The need to maintain high time-window reliability at reasonable cost. The challenge of directly handling joint chance constraints.

    A Stochastic Model Predictive Control Strategy for Vehicle Routing with Correlated Stochastic Service Times · 2026 · DOI

  • The lack of effective methods for handling uncertainty in Vehicle Routing Problems. The need for a strategy that can maintain high time-window reliability at reasonable cost. The gap in integrating chance-constrained optimization with Model Predictive Control in VRPTW.

    A Stochastic Model Predictive Control Strategy for Vehicle Routing with Correlated Stochastic Service Times · 2026 · DOI

  • Future research can focus on extending the proposed method to other micro-mobility services. Future research can focus on comparing the proposed method with other optimization methods. Future research can focus on evaluating the proposed method in real-world scenarios.

    Micro-mobility dispatch optimization via quantum annealing incorporating historical data · 2026 · DOI

  • The paper identifies a research gap in the lack of efficient and adaptive dispatch algorithms for micro-mobility services. The paper identifies a research gap in the lack of incorporation of historical usage data in dispatch formulations.

    Micro-mobility dispatch optimization via quantum annealing incorporating historical data · 2026 · DOI

  • The generalized assignment problem with routing constraints is a complex problem that requires effective solutions. Prior work on the problem has limitations and gaps that need to be addressed.

    Learn to Formulate: A Surrogate Model Framework for Generalized Assignment Problem with Routing Constraints · 2026 · DOI

  • Further research can be done to test the algorithm on large-scale cases and real-world applications. The method can be extended to other logistics systems with similar constraints and objectives.

    Research on Cold Chain Logistics Route Optimization Based on Improved Genetic Algorithm · 2026 · DOI

  • The study suggests further research on the application of the proposed framework. The study recommends evaluating the framework with different datasets and scenarios.

    An Integrated Circular Intuitionistic Fuzzy MCDM Framework with Radius Operators for Same-Day Delivery Service Selection · 2026 · DOI

  • The study addresses the uncertainty and ambiguity in the evaluation of alternatives.

    An Integrated Circular Intuitionistic Fuzzy MCDM Framework with Radius Operators for Same-Day Delivery Service Selection · 2026 · DOI

  • 14669/AM/214254 23 or catastrophes, such as the COVID-19, as resilience, and the evidence on supply chain resilience may contradict the lack of robustness we claim in this work, so further investigation is needed. Hence, further investigation into the role of structural stability into overall robustness and resilience, should be addressed.

    Network Algorithm to Model Automotive Supply Chain Structure · 2026 · DOI

  • The lack of adaptability to changing situations in real-time is a gap in current methods. Traditional static routing methods are ineffective in dynamic and uncertain operational conditions.

    Methods of deep reinforcement learning for adaptive optimization of military logistics routes · 2026 · DOI

  • The location-routing problem in the pallet pooling system is a challenging problem due to demand uncertainty. There is a lack of studies that address the location-routing problem in the pallet pooling system using a mixed-integer linear programming model and a heuristic algorithm.

    The location-routing problem in the pallet pooling system with demand uncertainty · 2026 · DOI

  • In many cases, it achieves optimal solutions when such solutions are known and remains competitive when the exact method cannot close the optimality gap. There are several potential directions for future research. On the exact side, improving the efficiency of the pricing algorithm –such as through stronger dominance rules or tighter upper bounds– appears crucial for extending the size of solvable instances.

    The hazardous team orienteering problem · 2026 · DOI

  • Current research on AGV system task allocation primarily focuses on unmanned automated terminals and goods-to-picker picking systems, with limited attention to express distribution centers. There is a lack of studies on the assignment problem of AGV sorting systems in express distribution centers.

    AGV Assignment Strategy in Express Distribution Center Based on Closed Queueing Model · 2026 · DOI

  • The optimization of cold chain logistics distribution is a complex problem due to temperature control requirements and multiple operational constraints. Existing research mainly focuses on cost control, carbon emission constraints, and distribution efficiency, but may not fully address the complexities of cold chain logistics.

    Research on Cold Chain Logistics Route Optimization Based on Improved Genetic Algorithm · 2026 · DOI

  • The Capacitated Arc Routing Problem does not account for priority edges. Prior algorithms for CARP do not consider priority edges.

    Applying priority edges for Capacitated Arc Routing Problem: problem extension and genetic algorithm · 2026 · DOI

  • To apply the HS-CW method to other fields where the location-allocation problem is relevant. To compare the HS-CW method with other metaheuristic algorithms. To use the HS-CW method in real-world problems to test its efficiency.

    Harmony Search with Clarke and Wright Savings in Solving the Location-Allocation Vehicle Routing Problem · 2026 · DOI

  • The existing mathematical linear programming was not able to solve the location-allocation vehicle routing problem efficiently. The Harmony Search algorithm was not able to provide the optimal solution for the location-allocation vehicle routing problem.

    Harmony Search with Clarke and Wright Savings in Solving the Location-Allocation Vehicle Routing Problem · 2026 · DOI

  • Investigating the application of GW-based methods to other large-scale assignment problems, - Exploring the use of different GW variants and parameters to improve solution quality and efficiency, - Developing more efficient algorithms for solving CQAP and related…

    Gromov–Wasserstein Meets Combinatorial Optimization: A Scalable Solver for the Capacitated Quadratic Assignment Problem · 2026 · DOI

  • Classical exact solvers are computationally infeasible for large-scale instances - Heuristic methods suffer from scalability limitations and sensitivity to local optima - The need for principled scalable approximations for the Capacitated Quadratic Assignment…

    Gromov–Wasserstein Meets Combinatorial Optimization: A Scalable Solver for the Capacitated Quadratic Assignment Problem · 2026 · DOI

  • Conventional urban logistics models assume constant travel speeds, overlooking dynamic traffic conditions and customer time-window constraints on service quality. Conventional ant colony optimization algorithms optimize routing decisions but fail to explicitly coordinate vehicle service start times.

    An Improved ACO for the Urban Logistics Delivery Problem Considering Dynamic Traffic Conditions and Customer Service Quality · 2026 · DOI

  • Evaluation of Q-learning variants for other optimization problems. Comparison of Q-learning with other optimization methods. Application of the study's findings to real-world instances.

    Reinforcement learning for solving optimization problems: Opportunities and limitations on the example of the assignment problem · 2026 · DOI

  • The sample size is limited (5 independent runs for each configuration) - The study may not fully capture the dispersion inherent in the stochastic genetic…

    Use of greedy and genetic algorithms for optimal mobile network base station placement · 2026 · DOI

  • Using a significantly larger number of iterations (e.g., 30 or more) for genetic algorithm evaluation - Conducting an extended statistical analysis for confirmation of the absolute stability…

    Use of greedy and genetic algorithms for optimal mobile network base station placement · 2026 · DOI

  • To further analyze the impact of demand uncertainty on the pallet pooling system. To develop more efficient algorithms to solve the combinatorial optimization problem. To apply the proposed model and algorithm to other logistics systems.

    The location-routing problem in the pallet pooling system with demand uncertainty · 2026 · DOI

  • The study identifies a gap in the existing literature on discrete metaheuristic algorithms for solving permutation-based combinatorial optimization problems. The study aims to fill this gap by proposing a discrete adaptation of the enzyme action optimizer.

    A discrete enzyme action optimizer for traveling salesman problems with a smart tourism routing application: a case study in Bitlis, Türkiye · 2026 · DOI

Most-cited papers in Vehicle Routing Optimization Methods

Most recent work

Find a gap in your own Vehicle Routing Optimization Methods sub-topic

This page shows what the Vehicle Routing Optimization Methods literature already flags as unresolved. To narrow it to your specific question, search the Research Gap Finder: the search is free with a free account and lists the papers closest to your topic first. Unlocking that topic (50 credits, charged once) fills the comparison table from our 4.5M-paper local library and writes the gaps from its rows.

Open the Research Gap Finder →

Related topics in Engineering

Human auditory perception and evaluation
583 open questions
Perovskite Materials and Applications
501 open questions
Concrete and Cement Materials Research
439 open questions
Urban Design and Spatial Analysis
424 open questions
Advancements in Battery Materials
409 open questions
Traffic and Road Safety
384 open questions
Spatial Cognition and Navigation
384 open questions
Digital Transformation in Industry
367 open questions
Open questions raised by papers listed on this page include: (1) The lack of effective methods for handling uncertainty in Vehicle Routing Problems (“A Stochastic Model Predictive Control Strategy for Vehicle Routing with…”, 2026); (2) Future research can focus on extending the proposed method to other micro-mobility services (“Micro-mobility dispatch optimization via quantum annealing incorporating…”, 2026); (3) The lack of adaptability to changing situations in real-time is a gap in current methods (“Methods of deep reinforcement learning for adaptive optimization of military…”, 2026); (4) There is a lack of studies that address the location-routing problem in the pallet pooling system using a mixed-integer linear programming model and a heuristic algorithm (“The location-routing problem in the pallet pooling system with demand…”, 2026); (5) There is a lack of studies on the assignment problem of AGV sorting systems in express distribution centers (“AGV Assignment Strategy in Express Distribution Center Based on Closed Queueing…”, 2026). 70 gap statements have been mined from Vehicle Routing Optimization Methods papers in our 4.5M-paper local library, which holds 1,293 papers on the topic; the gaps come from whichever of those papers state one. They are mostly the research gaps the authors state and the papers' abstracts, plus future-work, limitations and challenges passages. The ones listed below are a selection still marked open; each names the study that raised it, with a DOI link where the paper has one, so you can read the original claim in context.

Tools for your next paper

Gaps & Literature SearchFind open questions in any field — 120,000+ open gaps mined from our own library.Pre-CheckIs your paper ready? Acceptance odds for top, mid and open/emerging journals, in seconds.Journal FinderA ranked shortlist of target journals from a 17,500-venue index.Duplicate Publication CheckerCheck for prior publication across 7 sources and our local library.Citation GeneratorFreeA DOI or title → APA, MLA, Vancouver, Chicago, BibTeX, RIS. No signup.Graphical Abstract MakerFreeTurn your findings into a colorblind-safe graphical abstract.

How Pre-Check worksHow AI Review works

Compare the category — Honest roundups of the AI research tools, ours listed alongside the alternatives.

Command palette

Jump anywhere, run any action.