Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Orienteering problem: A survey of recent variants, solution approaches and applications
Abstract The Orienteering Problem (OP) has received a lot of attention in the past few
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …
Chapter 10: Vehicle routing problems with profits
10.1▪ Introduction The key characteristic of the class of Vehicle Routing Problems with Profits
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
An effective PSO-inspired algorithm for the team orienteering problem
The Team Orienteering Problem (TOP) is a particular vehicle routing problem in which the
aim is to maximize the profit gained from visiting customers without exceeding a travel …
aim is to maximize the profit gained from visiting customers without exceeding a travel …
A fast solution method for the time-dependent orienteering problem
This paper introduces a fast solution procedure to solve 100-node instances of the time-
dependent orienteering problem (TD-OP) within a few seconds of computation time …
dependent orienteering problem (TD-OP) within a few seconds of computation time …
Robust UAV mission planning
Abstract Unmanned Aerial Vehicles (UAVs) can provide significant contributions to
information gathering in military missions. UAVs can be used to capture both full motion …
information gathering in military missions. UAVs can be used to capture both full motion …
A branch‐and‐cut algorithm for the Team Orienteering Problem
Abstract The Team Orienteering Problem aims at maximizing the total amount of profit
collected by a fleet of vehicles while not exceeding a predefined travel time limit on each …
collected by a fleet of vehicles while not exceeding a predefined travel time limit on each …
Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm
In intelligent manufacturing, it is important to schedule orders from customers efficiently.
Make-to-order companies may have to reject or postpone orders when the production …
Make-to-order companies may have to reject or postpone orders when the production …
Enhanced exact solution methods for the team orienteering problem
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family
of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price …
of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price …
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
Abstract The Team Orienteering Problem (TOP) is a well-known NP-Hard vehicle routing
problem in which one maximizes the collected profits for visiting some nodes. In this paper …
problem in which one maximizes the collected profits for visiting some nodes. In this paper …
Pareto mimic algorithm: An approach to the team orienteering problem
The team orienteering problem is an important variant of the vehicle routing problem. In this
paper, a new algorithm, called Pareto mimic algorithm, is proposed to deal with it. This …
paper, a new algorithm, called Pareto mimic algorithm, is proposed to deal with it. This …