On the public citation graph
Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem
0 signed · 106 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/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1002/net.3230160104openalex-snapshot
An exact algorithm for the asymmetrical capacitated vehicle routing problem
inferredcites →https://doi.org/10.1002/net.3230190602openalex-snapshot
The prize collecting traveling salesman problem
inferredcites →https://doi.org/10.1007/978-1-4614-6940-7_13openalex-snapshot
Very Large-Scale Neighborhood Search
inferredcites →https://doi.org/10.1016/0166-3615(92)90069-yopenalex-snapshot
Discrete event sequencing as a traveling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(92)90028-2openalex-snapshot
Large-step markov chains for the TSP incorporating local search heuristics
inferredcites →https://doi.org/10.1016/0270-0255(87)90004-2openalex-snapshot
A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
inferredcites →https://doi.org/10.1016/0305-0548(94)90065-5openalex-snapshot
A heuristic for the multiple tour maximum collection problem
inferredcites →https://doi.org/10.1016/0377-2217(94)00289-4openalex-snapshot
The team orienteering problem
inferredcites →https://doi.org/10.1016/s0166-218x(01)00338-9openalex-snapshot
A survey of very large-scale neighborhood search techniques
inferredcites →https://doi.org/10.1016/s0305-0548(98)00071-9openalex-snapshot
An optimal solution procedure for the multiple tour maximum collection problem using column generation
inferredcites →https://doi.org/10.1016/s0360-8352(03)00038-xopenalex-snapshot
A flexible decision support system for steel hot rolling mill scheduling
inferredcites →https://doi.org/10.1016/s0377-2217(02)00363-6openalex-snapshot
Vehicle routing problem with time windows and a limited number of vehicles
inferredcites →https://doi.org/10.1016/s0377-2217(97)00277-4openalex-snapshot
The hot strip mill production scheduling problem: A tabu search approach
inferredcites →https://doi.org/10.1016/s0377-2217(99)00380-xopenalex-snapshot
A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex
inferredcites →https://doi.org/10.1057/jors.1992.73openalex-snapshot
A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
inferredcites →https://doi.org/10.1111/j.1475-3995.2000.tb00201.xopenalex-snapshot
Very large-scale neighborhood search
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.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
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.2.342openalex-snapshot
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/opre.41.5.935openalex-snapshot
Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
inferredcites →https://doi.org/10.1287/opre.6.6.791openalex-snapshot
A Method for Solving Traveling-Salesman Problems
inferredcites →https://doi.org/10.1287/trsc.26.2.69openalex-snapshot
An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_12openalex-snapshot
Iterated Local Search: Framework and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-38766-2_8openalex-snapshot
A Hybrid Firefly Algorithm Based on Coordinates for the Prize-Collecting Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-39391-5_10openalex-snapshot
A Discrete Inspired Bat Algorithm for Firetruck Dispatch in Emergency Situations
inferred← citeshttps://doi.org/10.1007/978-3-031-77941-1_16openalex-snapshot
Solving a Shareable-Setup Time Prize Collection VRP Applied to an Electrical Maintenance Sector
inferred← citeshttps://doi.org/10.1007/978-3-319-64286-4_3openalex-snapshot
Soft Computing Methods in Transport and Logistics
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_5openalex-snapshot
Iterated Local Search: Framework and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-30749-2_5openalex-snapshot
Network Configuration in Presence of Synchronization Requirements
inferred← citeshttps://doi.org/10.1007/s00170-006-0857-zopenalex-snapshot
Integration of batching and scheduling for hot rolling production in the steel industry
inferred← citeshttps://doi.org/10.1007/s00170-006-0904-9openalex-snapshot
Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling
inferred← citeshttps://doi.org/10.1007/s00170-009-2058-zopenalex-snapshot
Guided local search algorithm for hot strip mill scheduling problem with considering hot charge rolling
inferred← citeshttps://doi.org/10.1007/s00170-010-2988-5openalex-snapshot
A hybrid simulated annealing for the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and costs and dynamic release of jobs
inferred← citeshttps://doi.org/10.1007/s00170-011-3749-9openalex-snapshot
A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem
inferred← citeshttps://doi.org/10.1007/s00170-015-7326-5openalex-snapshot
Research and application of multiple constrained hot strip mill scheduling problem based on HPSA
inferred← citeshttps://doi.org/10.1007/s00291-016-0454-yopenalex-snapshot
The multi-vehicle profitable pickup and delivery problem
inferred← citeshttps://doi.org/10.1007/s00291-019-00563-yopenalex-snapshot
A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
inferred← citeshttps://doi.org/10.1007/s10732-014-9242-5openalex-snapshot
A survey on algorithmic approaches for solving tourist trip design problems
inferred← citeshttps://doi.org/10.1007/s10732-025-09555-4openalex-snapshot
A reliability-extended simheuristic for the sustainable vehicle routing problem with stochastic travel times and demands
inferred← citeshttps://doi.org/10.1007/s10886-006-9222-9openalex-snapshot
Induction of Oxidative Stress by Sunflower Phytotoxins in Germinating Mustard Seeds
inferred← citeshttps://doi.org/10.1007/s11067-025-09684-0openalex-snapshot
Practical and Effective Heuristics for the Backhaul Profit Maximization Problem
inferred← citeshttps://doi.org/10.1007/s11750-014-0336-xopenalex-snapshot
Profitable mixed capacitated arc routing and related problems
inferred← citeshttps://doi.org/10.1007/s12046-023-02238-5openalex-snapshot
Fermatean fuzzy vehicle routing problem with profit: solution algorithms, comparisons and developments
inferred← citeshttps://doi.org/10.1007/s12613-025-3188-5openalex-snapshot
Advancements in production planning and scheduling within steel manufacturing: A review and its intelligent development
inferred← citeshttps://doi.org/10.1007/s12667-021-00477-1openalex-snapshot
A teaching–learning-based optimization algorithm for the environmental prize-collecting vehicle routing problem
inferred← citeshttps://doi.org/10.1007/s13676-013-0022-4openalex-snapshot
The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.02.040openalex-snapshot
A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2008.05.001openalex-snapshot
A method of solving a large-scale rolling batch scheduling problem in steel production using a variant of column generation
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106606openalex-snapshot
A review of planning and scheduling methods for hot rolling mills in steel production
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107528openalex-snapshot
A decomposition based metaheuristic approach for solving rapid needs assessment routing problem
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109552openalex-snapshot
Last mile delivery routing problem using autonomous electric vehicles
inferred← citeshttps://doi.org/10.1016/j.cie.2024.110730openalex-snapshot
Set Covering Routing Problems: A review and classification scheme
inferred← citeshttps://doi.org/10.1016/j.cie.2025.110991openalex-snapshot
Last-mile delivery optimization: Leveraging electric vehicles and parcel lockers for prime customer service
inferred← citeshttps://doi.org/10.1016/j.cie.2025.111735openalex-snapshot
Battery drones versus hydrogen fuel cell drones for last-mile delivery
inferred← citeshttps://doi.org/10.1016/j.cor.2011.04.009openalex-snapshot
Development of hybrid evolutionary algorithms for production scheduling of hot strip mill
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105316openalex-snapshot
The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.015openalex-snapshot
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.08.027openalex-snapshot
The vehicle routing problem with service level constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.02.037openalex-snapshot
A unifying framework for selective routing problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.07.007openalex-snapshot
Robot-aided electric vehicle routing problem with lockers and prime customers prioritization
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.03.004openalex-snapshot
A fuzzy GRASP for the tourist trip design with clustered POIs
inferred← citeshttps://doi.org/10.1016/j.eswa.2020.113563openalex-snapshot
An interactive preference-guided firefly algorithm for personalized tourist itineraries
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121457openalex-snapshot
A Multimodal Tourist Trip Planner Integrating Road and Pedestrian Networks
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125183openalex-snapshot
Prize-collecting Electric Vehicle routing model for parcel delivery problem
inferred← citeshttps://doi.org/10.1016/j.ins.2018.11.006openalex-snapshot
A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.jmsy.2023.06.009openalex-snapshot
A knowledge-based NSGA-II algorithm for multi-objective hot rolling production scheduling under flexible time-of-use electricity pricing
inferred← citeshttps://doi.org/10.1016/j.knosys.2021.107257openalex-snapshot
Tourist group itinerary design: When the firefly algorithm meets the n-person Battle of Sexes
inferred← citeshttps://doi.org/10.1016/j.omega.2019.02.003openalex-snapshot
Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements
inferred← citeshttps://doi.org/10.1016/j.rico.2023.100292openalex-snapshot
Utilizing a hybrid metaheuristic algorithm to solve capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.swevo.2020.100712openalex-snapshot
A firefly algorithm for the environmental prize-collecting vehicle routing problem
inferred← citeshttps://doi.org/10.1016/j.tre.2016.07.006openalex-snapshot
A milk collection problem with blending
inferred← citeshttps://doi.org/10.1080/00207543.2011.654138openalex-snapshot
A multi-objective optimisation algorithm for the hot rolling batch scheduling problem
inferred← citeshttps://doi.org/10.1080/00207543.2022.2037777openalex-snapshot
Designing a sustainable freight transportation network with cross-docks
inferred← citeshttps://doi.org/10.1080/24725854.2026.2655760openalex-snapshot
Optimal scheduling of shared mobile precooling devices in post-harvest precooling
inferred← citeshttps://doi.org/10.1108/bij-10-2021-0589openalex-snapshot
A hybrid approach to solve a raw material collecting vehicle routing problem
inferred← citeshttps://doi.org/10.1109/bicta.2010.5645061openalex-snapshot
Solving hot rolling scheduling problem by a new population-based extremal optimization algorithm
inferred← citeshttps://doi.org/10.1109/ccdc.2009.5192948openalex-snapshot
Optimization model and algorithm for goods delivery under E-commerce
inferred← citeshttps://doi.org/10.1109/clei.2015.7359988openalex-snapshot
An application of ILS heuristic to Periodic Vehicle Routing Problem with heterogeneous fleet and fixed costs
inferred← citeshttps://doi.org/10.1109/fuzz-ieee.2016.7737883openalex-snapshot
Solving the Team Orienteering Problem with fuzzy scores and constraints
inferred← citeshttps://doi.org/10.1109/iccar.2015.7166031openalex-snapshot
A hybrid edge recombination approach to solve price collecting vehicle routing problem
inferred← citeshttps://doi.org/10.1109/ieem.2010.5674373openalex-snapshot
A hybrid simulated annealing for the single machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and costs
inferred← citeshttps://doi.org/10.1109/tcst.2011.2170196openalex-snapshot
Modeling and Solution for the Coil Sequencing Problem in Steel Color-Coating Production
inferred← citeshttps://doi.org/10.1109/tcyb.2025.3634438openalex-snapshot
Robust Hot Rolling Production Scheduling Under Carbon Tax Regulation
inferred← citeshttps://doi.org/10.1109/wcica.2010.5554758openalex-snapshot
Method for hot rolling planning considering material requirements of downstream production lines
inferred← citeshttps://doi.org/10.1111/itor.13319openalex-snapshot
A blockchain‐based framework to optimize shipping container flows in the hinterland
inferred← citeshttps://doi.org/10.1145/3712255.3726559openalex-snapshot
Modeling and Solution to Hot Rolling Production Rescheduling Problem
inferred← citeshttps://doi.org/10.1155/2017/1048081openalex-snapshot
Optimizing Production Scheduling of Steel Plate Hot Rolling for Economic Load Dispatch under Time‐of‐Use Electricity Pricing
inferred← citeshttps://doi.org/10.1287/trsc.1110.0396openalex-snapshot
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping
inferred← citeshttps://doi.org/10.1287/trsc.2015.0584openalex-snapshot
Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits
inferred← citeshttps://doi.org/10.1504/ijsoi.2012.052179openalex-snapshot
Effective local search approaches for the single-vehicle cyclic inventory routing problem
inferred← citeshttps://doi.org/10.1590/s0101-74382012005000016openalex-snapshot
Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen
inferred← citeshttps://doi.org/10.1613/jair.2674openalex-snapshot
Efficient Informative Sensing using Multiple Robots
inferred← citeshttps://doi.org/10.24247/ijmperdjun201720openalex-snapshot
Multi-Objective for a Partial Flexible Open Shop Scheduling Problem Using a Priority-Based Evolutionary Algorithm
inferred← citeshttps://doi.org/10.2514/6.2009-1951openalex-snapshot
Large-Scale Dynamic Observation Planning for Unmanned Surface Vessels
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.01334openalex-snapshot
Two-stage Method for Solving Large-scale Hot Rolling Planning Problem in Steel Production
inferred← citeshttps://doi.org/10.3390/math11092050openalex-snapshot
Improved Differential Evolution Algorithm for Slab Allocation and Hot-Rolling Scheduling Integration Problem
inferred← citeshttps://doi.org/10.3724/sp.j.1004.2010.00304openalex-snapshot
A New Enhanced-Dynasearch & TS for the Pickling-rolling Scheduling Problem
inferred← citeshttps://doi.org/10.3934/jimo.2016.12.1391openalex-snapshot
A priority-based genetic algorithm for a flexible job shop scheduling problem
inferred← citeshttps://doi.org/10.3934/jimo.2022187openalex-snapshot
Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1810.03981openalex-snapshot
Solving the clustered traveling salesman problem with d-relaxed priority rule
inferred← citeshttps://doi.org/10.70675/f60edf45z0993z4883zac25z314d02525910openalex-snapshot
A dynamic programming operator for metaheuristics to solve vehicle routing problems with optional visits
inferred← citeshttps://doi.org/10.70675/ff69a435zc63cz4906z8b81z7a36c77a0c1bopenalex-snapshot
Modèles et Algorithmes pour les Problèmes de Livraison du Dernier Kilomètre avec Plusieurs Options d'Expédition
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.