On the public citation graph
A comparison of techniques for solving the fleet size and mix vehicle routing problem
0 signed · 83 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230070203openalex-snapshot
Implementing vehicle routing algorithms
inferredcites →https://doi.org/10.1002/net.3230110205openalex-snapshot
A generalized assignment heuristic for vehicle routing
inferredcites →https://doi.org/10.1007/bf01580430openalex-snapshot
A branch and bound algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferredcites →https://doi.org/10.1016/0305-0548(84)90007-8openalex-snapshot
The fleet size and mix vehicle routing problem
inferredcites →https://doi.org/10.1016/0377-2217(84)90050-xopenalex-snapshot
A Lagrangean relaxation heuristic for vehicle routing
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.28.3.694openalex-snapshot
Approximate Traveling Salesman Algorithms
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.4779152openalex-extracted
Optimisation Framework for Integrated Production-Inventory-Routing Problem for Oxygen Supply Chains
inferred← citeshttps://doi.org/10.1002/net.20331openalex-snapshot
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_1openalex-snapshot
Routing a Heterogeneous Fleet of Vehicles
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_11openalex-snapshot
Global and Local Moves in Tabu Search: A Real-Life Mail Collecting Application
inferred← citeshttps://doi.org/10.1007/978-3-031-42505-9_21openalex-snapshot
Bus Route Classification for Rural Areas Using Graph Convolutional Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-17509-6_8openalex-snapshot
A Vessel Scheduling Problem with Special Cases
inferred← citeshttps://doi.org/10.1007/978-3-319-98615-9_16openalex-snapshot
Problems of Deliveries in Urban Agglomeration Distribution Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73312-6_11openalex-snapshot
School Bus Routing in Rural School Districts
inferred← citeshttps://doi.org/10.1007/978-3-642-32081-1_10openalex-snapshot
Environmental Issues in Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/bf01720977openalex-snapshot
Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches
inferred← citeshttps://doi.org/10.1007/bf02367673openalex-snapshot
A class of heuristic algorithms for the routing problem
inferred← citeshttps://doi.org/10.1007/bfb0121103openalex-snapshot
A new heuristic for determining fleet size and composition
inferred← citeshttps://doi.org/10.1007/s00291-017-0494-yopenalex-snapshot
Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s00291-025-00834-xopenalex-snapshot
Maximizing the average fuel savings for aircraft fleet under a fixed periodic schedule
inferred← citeshttps://doi.org/10.1007/s10100-007-0036-9openalex-snapshot
Scatter search for the fleet size and mix vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1007/s10100-017-0501-zopenalex-snapshot
The sales force sizing problem with multi-period workload assignments, and service time windows
inferred← citeshttps://doi.org/10.1007/s10732-007-9045-zopenalex-snapshot
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1007/s12351-019-00471-7openalex-snapshot
Vehicle assignment in site-dependent vehicle routing problems with split deliveries
inferred← citeshttps://doi.org/10.1007/s13272-018-0344-xopenalex-snapshot
Potential of integrated flight scheduling and rotation planning considering aerodynamic-, engine- and mass-related aircraft deterioration
inferred← citeshttps://doi.org/10.1016/0191-2607(85)90039-1openalex-snapshot
Future directions in logistics research
inferred← citeshttps://doi.org/10.1016/0305-0483(92)90009-vopenalex-snapshot
Adaptation of some vehicle fleet mix heuristics
inferred← citeshttps://doi.org/10.1016/0305-0548(91)90028-popenalex-snapshot
A new heuristic for the fleet size and mix vehicle routing problem
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90220-hopenalex-snapshot
Incorporating vehicle routing into the vehicle fleet composition problem
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50006-xopenalex-snapshot
A Principled Approach to Solving Complex Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-385202-1.00008-6openalex-snapshot
The Vehicle-Routing Problem
inferred← citeshttps://doi.org/10.1016/j.cie.2012.11.007openalex-snapshot
Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2024.108827openalex-snapshot
Towards efficient solutions for vehicle routing problems for oxygen supply chains
inferred← citeshttps://doi.org/10.1016/j.cor.2005.08.002openalex-snapshot
A column generation approach to the heterogeneous fleet vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2010.03.015openalex-snapshot
Industrial aspects and literature survey: Fleet composition and routing
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.08.003openalex-snapshot
Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.07.020openalex-snapshot
Thirty years of heterogeneous vehicle routing
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.07.691openalex-snapshot
Mixed Integer Linear Programming Model for Vehicle Routing Problem for Hazardous Materials Transportation**Universidad Nacional de Colombia. Universite de Technologie de Troyes.
inferred← citeshttps://doi.org/10.1016/j.ijpe.2013.01.020openalex-snapshot
The heterogeneous fleet vehicle routing problem with overloads and time windows
inferred← citeshttps://doi.org/10.1016/j.pdisas.2025.100411openalex-snapshot
A combined fleet size and mix vehicle routing model for last-mile distribution in disaster relief
inferred← citeshttps://doi.org/10.1016/j.tre.2015.12.001openalex-snapshot
A tabu search heuristic for the heterogeneous vehicle routing problem on a multigraph
inferred← citeshttps://doi.org/10.1016/j.tre.2021.102554openalex-snapshot
Stochastic fleet mix optimization: Evaluating electromobility in urban logistics
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00100-2openalex-snapshot
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00237-5openalex-snapshot
A sweep-based algorithm for the fleet size and mix vehicle routing problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00253-6openalex-snapshot
A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
inferred← citeshttps://doi.org/10.1016/s1874-8651(08)60013-7openalex-snapshot
Dynamic Optimal Model of Vehicle Fleet Size and Exact Algorithm
inferred← citeshttps://doi.org/10.1038/s41598-024-76967-wopenalex-snapshot
Applying quantum approximate optimization to the heterogeneous vehicle routing problem
inferred← citeshttps://doi.org/10.1051/ro:1999101openalex-snapshot
A heuristic column generation method for the heterogeneous fleet VRP
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601422openalex-snapshot
New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601443openalex-snapshot
A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602421openalex-snapshot
A heuristic for vehicle fleet mix problem using tabu search and set partitioning
inferred← citeshttps://doi.org/10.1080/03155986.2016.1149314openalex-snapshot
Simple heuristics for the multi-period fleet size and mix vehicle routing problem
inferred← citeshttps://doi.org/10.1080/03155986.2016.1149315openalex-snapshot
Design of a reverse logistics network for recyclable collection in Nova Scotia using compaction trailers
inferred← citeshttps://doi.org/10.1080/23249935.2018.1523249openalex-snapshot
A review of fleet planning problems in single and multimodal transportation systems
inferred← citeshttps://doi.org/10.1088/1755-1315/426/1/012138openalex-snapshot
Comparison of Simulated Annealing, Nearest Neighbour, and Tabu Search Methods to Solve Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1108/jdal-03-2020-0005openalex-snapshot
A heuristic approach applied to the fleet sizing problem for military ground vehicles
inferred← citeshttps://doi.org/10.1109/icsi.1990.138708openalex-snapshot
A toolkit for vehicle routing
inferred← citeshttps://doi.org/10.1109/la-cci47412.2019.9037042openalex-snapshot
Deep Reinforcement Learning for Routing a Heterogeneous Fleet of Vehicles
inferred← citeshttps://doi.org/10.1109/plmo62307.2024.10887165openalex-snapshot
Problem of Building Circular Routes for the Delivery of Discrete Cargo in the Transport Network
inferred← citeshttps://doi.org/10.1109/tai.1998.744862openalex-snapshot
The guided genetic algorithm and its application to the generalized assignment problem
inferred← citeshttps://doi.org/10.1109/tcss.2025.3571479openalex-snapshot
Multipopulation Optimization With LLM-Driven Knowledge Discovery for Large-Scale HFVRP
inferred← citeshttps://doi.org/10.1111/mice.12036openalex-snapshot
Optimal Clustering of Railroad Track Maintenance Jobs
inferred← citeshttps://doi.org/10.11606/d.55.2021.tde-30062021-141245openalex-snapshot
Logística em redes varejistas: uma visão integrada de cross-docking e roteamento
inferred← citeshttps://doi.org/10.11606/t.3.2006.tde-05092006-145756openalex-snapshot
Scatter Search para problemas de roterização de veículos com frota heterogênea, janelas de tempo e entregas fracionadas.
inferred← citeshttps://doi.org/10.1287/opre.34.5.803openalex-snapshot
OR Forum—Perspectives on Vehicle Routing: Exciting New Developments
inferred← citeshttps://doi.org/10.1287/trsc.24.3.169openalex-snapshot
Fleet Size Planning when Outside Carrier Services Are Available
inferred← citeshttps://doi.org/10.1504/ejie.2014.066934openalex-snapshot
A successive approximations method for the heterogeneous vehicle routing problem: analysing different fleet configurations
inferred← citeshttps://doi.org/10.22395/rium.v13n25a6openalex-snapshot
Un algoritmo basado en búsqueda tabú granular para la solución de un problema de ruteo de vehículos considerando flota heterogénea
inferred← citeshttps://doi.org/10.26552/com.c.2013.1.6-13openalex-snapshot
The Shrinking and Expanding Heuristic for the Fleet Size and Mix Vehicle Routing Problem
inferred← citeshttps://doi.org/10.3138/infor.45.3.002openalex-snapshot
A Survey of the Generalized Assignment Problem and Its Applications
inferred← citeshttps://doi.org/10.3390/en14206651openalex-snapshot
Effective Permutation Encoding for Evolutionary Optimization of the Electric Vehicle Routing Problem
inferred← citeshttps://doi.org/10.3390/math12010028openalex-snapshot
Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment
inferred← citeshttps://doi.org/10.3390/su13116230openalex-snapshot
Data-Driven Methodology to Support Long-Lasting Logistics and Decision Making for Urban Last-Mile Operations
inferred← citeshttps://doi.org/10.34229/2707-451x.24.2.2openalex-snapshot
Mathematical Models of the Problem of Constructing Delivery Routes of Cargo in the Internal Zones of Trunk Nodes of a Hierarchical Transport Network
inferred← citeshttps://doi.org/10.3923/jas.2006.1969.1973openalex-snapshot
Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Nonlinearly Penalized Delays
inferred← citeshttps://doi.org/10.58837/chula.the.2017.202openalex-snapshot
TRANSPORT CAPACITY UTILISATION IMPROVEMENT FOR CONSUMER PRODUCT DISTRIBUTION
inferred← citeshttps://doi.org/10.70675/b4d999d7z3637z404dz93c4zbe62b3f0b47copenalex-snapshot
Vehicle Routing for Hazardous Material Transportation
inferred← citeshttps://doi.org/10.7282/t3bk1b2gopenalex-snapshot
Inventory and scheduling problems in supply chain management
inferred← citeshttps://doi.org/10.9744/jti.19.2.115-124openalex-snapshot
Algoritma Genetika untuk Pemecahan Masalah Rute Kendaraan dengan Ukuran dan Campuran Armada, Trip Majemuk, Pengiriman Terbagi, Produk Majemuk, dan Kendaraan dengan Kompartemen Majemuk
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.