On the public citation graph

Tabu Search heuristics for the Vehicle Routing Problem with Time Windows

0 signed · 153 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/1520-6750(199002)37:1<151::aid-nav3220370110>3.0.co;2-2openalex-snapshot

A lagrangian heuristic for set-covering problems

inferredcites →https://doi.org/10.1007/3-540-49481-2_30openalex-snapshot

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

inferredcites →https://doi.org/10.1007/3-540-64575-6_44openalex-snapshot

A hybrid genetic algorithm for the vehicle routing problem with time windows

inferredcites →https://doi.org/10.1007/978-1-4615-5775-3openalex-snapshot

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization

inferredcites →https://doi.org/10.1007/978-1-4615-5775-3_11openalex-snapshot

Global and Local Moves in Tabu Search: A Real-Life Mail Collecting Application

inferredcites →https://doi.org/10.1007/978-1-4615-5775-3_2openalex-snapshot

Metaheuristic for the Vehicle Routing Problem with Time Windows

inferredcites →https://doi.org/10.1007/978-1-4615-6089-0openalex-snapshot

Tabu Search

inferredcites →https://doi.org/10.1007/bf02023004openalex-snapshot

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

inferredcites →https://doi.org/10.1007/bf02430370openalex-snapshot

Probabilistic diversification and intensification in local search for vehicle routing

inferredcites →https://doi.org/10.1016/0166-218x(95)00027-oopenalex-snapshot

The simulated trading heuristic for solving vehicle routing problems

inferredcites →https://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot

Future paths for integer programming and links to artificial intelligence

inferredcites →https://doi.org/10.1016/0305-0548(93)90064-popenalex-snapshot

Designing collection routes through bank branches

inferredcites →https://doi.org/10.1016/0305-0548(94)90073-6openalex-snapshot

A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints

inferredcites →https://doi.org/10.1016/0377-2217(93)90221-8openalex-snapshot

A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

inferredcites →https://doi.org/10.1016/b978-0-08-040806-4.50037-xopenalex-snapshot

NEW EJECTION CHAIN AND ALTERNATING PATH METHODS FOR TRAVELING SALESMAN PROBLEMS

inferredcites →https://doi.org/10.1016/s0191-2615(99)00016-8openalex-snapshot

Solving the pickup and delivery problem with time windows using reactive tabu search

inferredcites →https://doi.org/10.1016/s0305-0548(03)00163-1openalex-snapshot

A parallel hybrid genetic algorithm for the vehicle routing problem with time windows

inferredcites →https://doi.org/10.1016/s0305-0548(97)00031-2openalex-snapshot

Variable neighborhood search

inferredcites →https://doi.org/10.1016/s0377-2217(02)00486-1openalex-snapshot

Local search with annealing-like restarts to solve the VRPTW

inferredcites →https://doi.org/10.1016/s0377-2217(96)00298-6openalex-snapshot

Planning models for freight transportation

inferredcites →https://doi.org/10.1016/s0927-0507%2805%2980106-9openalex-snapshot

Time Constrained Routing and Scheduling

inferredcites →https://doi.org/10.1016/s0954-1810(01)00005-xopenalex-snapshot

Heuristic methods for vehicle routing problem with time windows

inferredcites →https://doi.org/10.1016/s0968-090x(97)00005-3openalex-snapshot

A parallel tabu search heuristic for the vehicle routing problem with time windows

inferredcites →https://doi.org/10.1023/a:1009621410177openalex-snapshot

Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics

inferredcites →https://doi.org/10.1023/a:1015053600842openalex-snapshot

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

inferredcites →https://doi.org/10.1023/a:1018948011707openalex-snapshot

A parallel algorithm for the vehicle routing problem with time window constraints

inferredcites →https://doi.org/10.1057/jors.1995.204openalex-snapshot

An Exchange Heuristic for Routeing Problems with Time Windows

inferredcites →https://doi.org/10.1057/palgrave.jors.2601163openalex-snapshot

A unified tabu search heuristic for vehicle routing problems with time windows

inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot

Equation of State Calculations by Fast Computing Machines

inferredcites →https://doi.org/10.1080/03155986.1999.11732386openalex-snapshot

Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows

inferredcites →https://doi.org/10.1080/03155986.2003.11732675openalex-snapshot

A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows

inferredcites →https://doi.org/10.1080/07408179708966379openalex-snapshot

A computerized approach to the New York City school bus routing problem

inferredcites →https://doi.org/10.1080/07408179908969909openalex-snapshot

A capacitated vehicle routing problem for just-in-time delivery

inferredcites →https://doi.org/10.1137/1.9780898718515openalex-snapshot

The Vehicle Routing Problem

inferredcites →https://doi.org/10.1137/1.9780898718515.ch10openalex-snapshot

10. Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries

inferredcites →https://doi.org/10.1137/1.9780898718515.ch12openalex-snapshot

12. Inventory Routing in Practice

inferredcites →https://doi.org/10.1137/1.9780898718515.ch7openalex-snapshot

7. VRP with Time Windows

inferredcites →https://doi.org/10.1142/s021821300100060xopenalex-snapshot

A HYBRID SEARCH ALOGRITHM FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

inferredcites →https://doi.org/10.1145/141868.141871openalex-snapshot

Performance of various computers using standard linear equations software

inferredcites →https://doi.org/10.1201/9780429128356-9openalex-snapshot

A Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search Heuristic for Vehicle Routing Problems with Time Windows

inferredcites →https://doi.org/10.1287/ijocopenalex-snapshot

INFORMS Journal on Computing

inferredcites →https://doi.org/10.1287/ijoc.15.4.347.24896openalex-snapshot

A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows

inferredcites →https://doi.org/10.1287/ijoc.2.1.4openalex-snapshot

Tabu Search—Part II

inferredcites →https://doi.org/10.1287/ijoc.4.2.146openalex-snapshot

The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

inferredcites →https://doi.org/10.1287/ijoc.8.2.158openalex-snapshot

The Vehicle Routing Problem with Time Windows Part I: Tabu Search

inferredcites →https://doi.org/10.1287/ijoc.9.4.417openalex-snapshot

A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows

inferredcites →https://doi.org/10.1287/mnsc.40.10.1276openalex-snapshot

A Tabu Search Heuristic for the Vehicle Routing Problem

inferredcites →https://doi.org/10.1287/opre.12.4.568openalex-snapshot

Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

inferredcites →https://doi.org/10.1287/opre.34.5.803openalex-snapshot

OR Forum—Perspectives on Vehicle Routing: Exciting New Developments

inferredcites →https://doi.org/10.1287/opre.35.1.6openalex-snapshot

OR Practice—Computerized Vehicle Routing in the Soft Drink Industry

inferredcites →https://doi.org/10.1287/opre.35.2.254openalex-snapshot

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

inferredcites →https://doi.org/10.1287/opre.40.6.1086openalex-snapshot

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

inferredcites →https://doi.org/10.1287/opre.46.3.330openalex-snapshot

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

inferredcites →https://doi.org/10.1287/trsc.22.1.1openalex-snapshot

Survey Paper—Time Window Constrained Routing and Scheduling Problems

inferredcites →https://doi.org/10.1287/trsc.29.2.156openalex-snapshot

Hybrid Heuristics for the Vehicle Routing Problem with Time Windows

inferredcites →https://doi.org/10.1287/trsc.31.1.49openalex-snapshot

A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows

inferredcites →https://doi.org/10.1287/trsc.31.2.170openalex-snapshot

A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

inferredcites →https://doi.org/10.1515/9780691187563openalex-snapshot

Local Search in Combinatorial Optimization

inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot

Adaptation in Natural and Artificial Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4809478openalex-extracted

Service Network Design for Express Intra-City Courier Services

inferred← citeshttps://doi.org/10.1007/0-306-48056-5_2openalex-snapshot

An Introduction to Tabu Search

inferred← citeshttps://doi.org/10.1007/978-0-85729-766-2_5openalex-snapshot

Location Theory and Distribution Management

inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_2openalex-snapshot

Tabu Search

inferred← citeshttps://doi.org/10.1007/978-3-030-83442-5_1openalex-snapshot

VRP with Flexible Time Windows Using the ALNS Metaheuristic Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-031-32412-3_2openalex-snapshot

Two-Phase Algorithm for Solving Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1007/978-3-032-10895-1_21openalex-snapshot

Evaluation of Large Neighborhood Search Operators and Their Synergies in the Capacitated Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1007/978-3-032-12869-0_12openalex-snapshot

Evaluation of Large Neighborhood Search Operators and Their Synergies in the Capacitated Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1007/978-3-032-23604-3_7openalex-snapshot

Adaptive Curriculum Learning in Genetic Programming–Guided Local Search for Large-Scale Vehicle Routing Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-00557-7_67openalex-snapshot

An Integrated Production and Distribution Scheduling Approach for Exceptions Handling

inferred← citeshttps://doi.org/10.1007/978-3-319-05035-5_2openalex-snapshot

Survey of Methodologies for TSP and VRP

inferred← citeshttps://doi.org/10.1007/978-3-319-15892-1_28openalex-snapshot

Solutions in Under 10 Seconds for Vehicle Routing Problems with Time Windows Using Commodity Computers

inferred← citeshttps://doi.org/10.1007/978-3-319-30235-5_2openalex-snapshot

An Evolutionary Discrete Firefly Algorithm with Novel Operators for Solving the Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1007/978-3-319-67669-2_4openalex-snapshot

On Efficiently Solving the Vehicle Routing Problem with Time Windows Using the Bat Algorithm with Random Reinsertion Operators

inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_2openalex-snapshot

Tabu Search

inferred← citeshttps://doi.org/10.1007/978-3-642-01129-0_87openalex-snapshot

Evolutionary Freight Transportation Planning

inferred← citeshttps://doi.org/10.1007/978-3-642-04039-9_2openalex-snapshot

Solving Real-World Vehicle Routing Problems with Evolutionary Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-20958-1_8openalex-snapshot

Theory and Applications of Chaotic Optimization Methods

inferred← citeshttps://doi.org/10.1007/978-3-8349-6927-9_6openalex-snapshot

Tourenplanung

inferred← citeshttps://doi.org/10.1007/bf02579048openalex-snapshot

Routing relatively few customers per route

inferred← citeshttps://doi.org/10.1007/bf02941184openalex-snapshot

Annotated bibliography in vehicle routing

inferred← citeshttps://doi.org/10.1007/s10288-012-0224-xopenalex-snapshot

Optimization of empty container movements in intermodal transport

inferred← citeshttps://doi.org/10.1007/s10479-005-3971-7openalex-snapshot

Metaheuristics in Combinatorial Optimization

inferred← citeshttps://doi.org/10.1007/s10586-026-06015-xopenalex-snapshot

An optimized clustering method for the vehicle routing problem with time windows to improve Moroccan waste management

inferred← citeshttps://doi.org/10.1007/s10589-005-3070-3openalex-snapshot

A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1007/s10732-005-5431-6openalex-snapshot

Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1007/s11235-021-00833-7openalex-snapshot

Compact Sine Cosine Algorithm applied in vehicle routing problem with time window

inferred← citeshttps://doi.org/10.1007/s12065-025-01048-4openalex-snapshot

Novel hybrid swarm intelligence algorithm for solving the capacitated vehicle routing problem efficiently

inferred← citeshttps://doi.org/10.1007/s12159-016-0133-zopenalex-snapshot

A petrol station replenishment problem: new variant and formulation

inferred← citeshttps://doi.org/10.1007/s12597-012-0086-1openalex-snapshot

Neighborhood reduction strategy for tabu search implementation in asymmetric traveling salesman problem

inferred← citeshttps://doi.org/10.1016/b978-0-12-809786-1.16001-1openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/b978-0-12-815715-2.00009-9openalex-snapshot

Heuristics, metaheuristics, and hyperheuristics for rich vehicle routing problems

inferred← citeshttps://doi.org/10.1016/j.cie.2017.09.034openalex-snapshot

An adaptive hybrid algorithm for vehicle routing problems with time windows

inferred← citeshttps://doi.org/10.1016/j.cor.2003.11.023openalex-snapshot

A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

inferred← citeshttps://doi.org/10.1016/j.cor.2005.03.024openalex-snapshot

A dial-a-ride problem for client transportation in a health-care organization

inferred← citeshttps://doi.org/10.1016/j.ejor.2004.11.019openalex-snapshot

A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems

inferred← citeshttps://doi.org/10.1016/j.ejor.2011.10.042openalex-snapshot

Mid-term and short-term planning support for home health care services

inferred← citeshttps://doi.org/10.1016/j.eswa.2010.06.082openalex-snapshot

A hybrid algorithm for vehicle routing problem with time windows

inferred← citeshttps://doi.org/10.1016/j.omega.2023.102940openalex-snapshot

Tactical and operational planning of express intra-city package services

inferred← citeshttps://doi.org/10.1016/j.phpro.2012.03.273openalex-snapshot

Combining Nearest Neighbor Search with Tabu Search for Large-Scale Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.076openalex-snapshot

Variable Neighborhood Search based Set Covering ILP Model for the Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1016/j.procs.2015.05.501openalex-snapshot

A Solution for a Real-time Stochastic Capacitated Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1016/j.proeng.2012.06.295openalex-snapshot

DINLIP: Model for Integrated Decision, Bound and Time Driven Capacitated Multi Echelon Supply Chain Network

inferred← citeshttps://doi.org/10.1016/j.swevo.2023.101233openalex-snapshot

Deep reinforcement learning method for satellite range scheduling problem

inferred← citeshttps://doi.org/10.1016/j.trb.2007.04.007openalex-snapshot

Real time simulation of auctioning and re-scheduling processes in hybrid freight markets

inferred← citeshttps://doi.org/10.1016/j.trc.2024.104662openalex-snapshot

An integrated neural combinatorial Tabu Search for optimizing school bus scheduling with bell time

inferred← citeshttps://doi.org/10.1016/j.tre.2013.12.012openalex-snapshot

Bi-objective optimization of drayage operations in the service area of intermodal terminals

inferred← citeshttps://doi.org/10.1016/j.trpro.2025.03.060openalex-snapshot

A Time Window Assignment Strategy for Dynamic Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1061/jupddm.upeng-4195openalex-snapshot

Multimodal Feeder Plan of Setting Flex-Route Transit for Metro Terminal Station in Suburb Considering Real-Time Demand Based on Slack Arrival Strategy

inferred← citeshttps://doi.org/10.1088/1742-6596/1743/1/012029openalex-snapshot

A modified ALNS algorithm for vehicle routing problems with time windows

inferred← citeshttps://doi.org/10.1088/1742-6596/1933/1/012043openalex-snapshot

Artificial Bee Colony Algorithm for Solving Green Vehicle Routing Problems with Time Windows

inferred← citeshttps://doi.org/10.1109/access.2024.3373699openalex-snapshot

Logistics Optimization Using Hybrid Genetic Algorithm (HGA): A Solution to the Vehicle Routing Problem With Time Windows (VRPTW)

inferred← citeshttps://doi.org/10.1109/access.2025.3575459openalex-snapshot

Solving the Problem of Vehicle Routing Problem With Time Window via Dual Adaptive Genetic Algorithm

inferred← citeshttps://doi.org/10.1109/icaet63349.2025.10932238openalex-snapshot

Analysis of Metaheuristic Optimization Algorithms for Solving Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1109/icmse.2008.4668905openalex-snapshot

Genetic algorithm for vehicle routing problem with time windows and a limited number of vehicles

inferred← citeshttps://doi.org/10.1109/icmse.2008.4669126openalex-snapshot

A new Tabu Search heuristic algorithm for the Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1109/ictmod63116.2024.10959132openalex-snapshot

Optimizing Pickup Vehicle Routing with Dynamic Customer Requests: A Heuristic Approach

inferred← citeshttps://doi.org/10.1109/ipdps.2007.370431openalex-snapshot

Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1109/itsc.2005.1520130openalex-snapshot

Improved tabu search in an hybrid evolutionary approach for the pickup and delivery problem with time windows

inferred← citeshttps://doi.org/10.1109/lindi.2007.4343536openalex-snapshot

Optimization Algorithms (survey and analysis)

inferred← citeshttps://doi.org/10.1109/nabic.2012.6402252openalex-snapshot

A transgenic algorithm for the Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1109/smc.2015.371openalex-snapshot

An Improved Artificial Bee Colony Algorithm for the Capacitated Vehicle Routing Problem

inferred← citeshttps://doi.org/10.1109/tsmcc.2011.2148712openalex-snapshot

Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach

inferred← citeshttps://doi.org/10.1109/wicom.2008.1645openalex-snapshot

Hybrid Tabu Search Algorithm for Vehicle Routing Problem with Time Window

inferred← citeshttps://doi.org/10.11175/easts.10.880openalex-snapshot

A New Two-phase Hybrid Metaheuristic for Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1134/s0005117918060127openalex-snapshot

Application of Multiagent Technologies to Multiple Depot Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1145/3718491.3718586openalex-snapshot

Research on Distribution Path Planning of Campus Unmanned Vehicle

inferred← citeshttps://doi.org/10.13164/ma.2017.08openalex-snapshot

Downstream logistics optimization at EWOS Norway

inferred← citeshttps://doi.org/10.1371/journal.pone.0130224openalex-snapshot

Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows

inferred← citeshttps://doi.org/10.1371/journal.pone.0249077openalex-snapshot

Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0

inferred← citeshttps://doi.org/10.14201/adcaij.27533openalex-snapshot

Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach

inferred← citeshttps://doi.org/10.14267/phd.2017015openalex-snapshot

Egy turisztikai ajánlórendszer modellje

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.17.205openalex-snapshot

Intelligent Control of Interchangeable Loading Bridge for the Logistics of Tomorrow

inferred← citeshttps://doi.org/10.1504/ijeme.2014.066943openalex-snapshot

A multi-agent approach for dynamic production and distribution scheduling

inferred← citeshttps://doi.org/10.17760/d20487625openalex-snapshot

A neural combinatorial approach for school bus routing system optimization

inferred← citeshttps://doi.org/10.17981/cesta.02.01.2021.05openalex-snapshot

Uso del operador swap genera soluciones eficientes computacionales en un caso de enrutamiento de vehículos con enfoque de ventanas de tiempo

inferred← citeshttps://doi.org/10.2139/ssrn.6205843openalex-snapshot

A Commutative Bi-Level Multi-Objective Green Location–Routing Problem: A Novel Mathematical Model and Efficient Solution Method

inferred← citeshttps://doi.org/10.22452/mjcs.sp2019no2.3openalex-snapshot

THE NEW METHODOLOGY FOR VEHICULAR NETWORK WITH FUZZY TIME WINDOWS

inferred← citeshttps://doi.org/10.24406/publica-fhg-294563openalex-snapshot

Planning for home health care services

inferred← citeshttps://doi.org/10.3182/20070927-4-ro-3905.00087openalex-snapshot

HYBRID EVOLUTIONNARY APPROACHES AND NEW BENCHMARKS FOR THE 1-PDPTW

inferred← citeshttps://doi.org/10.3390/app15168786openalex-snapshot

Enhanced Path Planning by Repositioning the Starting Point

inferred← citeshttps://doi.org/10.3390/e15041247openalex-snapshot

A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

inferred← citeshttps://doi.org/10.3390/logistics10090192openalex-snapshot

Development of a Simulation Model for Optimizing the Transport and Logistics System of Industrial Waste Management

inferred← citeshttps://doi.org/10.3390/sym13010036openalex-snapshot

Multithreading Parallel Robust Approach for the VRPTW with Uncertain Service and Travel Times

inferred← citeshttps://doi.org/10.4018/978-1-5225-0435-1.ch004openalex-snapshot

Using a Hands-Free System to Manage Common Devices in Constrained Conditions

inferred← citeshttps://doi.org/10.4236/ajor.2012.22019openalex-snapshot

Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey

inferred← citeshttps://doi.org/10.4236/ojapps.2026.163053openalex-snapshot

Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) with Mobility of Certain Customers

inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1246095openalex-snapshot

Um estudo sobre problemas de roteamento de veículo com aplicação em uma rede de distribuição logística

inferred← citeshttps://doi.org/10.48550/arxiv.2103.05847openalex-snapshot

A Two-stage Framework and Reinforcement Learning-based Optimization Algorithms for Complex Scheduling Problems

inferred← citeshttps://doi.org/10.5505/pajes.2013.25733openalex-snapshot

Literature Review of Dynamic Unmanned Aerial System Routing Problems and Proposals For Future Studies of UASs

inferred← citeshttps://doi.org/10.5711/morj.12.3.59openalex-snapshot

A Tabu Search Approach to the Strategic Airlift Problem

inferred← citeshttps://doi.org/10.58837/chula.the.2017.11openalex-snapshot

Cuckoo search and enhanced artificial bee colony heuristic methods for vehicle routing problem with backhaul and time window constraints

inferred← citeshttps://doi.org/10.70675/9d2fbacez6a12z441fz9c89z564601363c9fopenalex-snapshot

Optimisation pour des problèmes industriels de tournées de véhicules : vers une transition énergétique

inferred← citeshttps://doi.org/10.70675/ae085074z1e72z4e94za1bezf0363155bdfdopenalex-snapshot

Méthodes de modélisation et d'optimisation par recherche à voisinages variables pour le problème de collecte et de livraison avec transbordement

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.