Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Quantum computing for energy systems optimization: Challenges and opportunities
The purpose of this paper is to explore the applications of quantum computing to energy
systems optimization problems and discuss some of the challenges faced by quantum …
systems optimization problems and discuss some of the challenges faced by quantum …
Rich vehicle routing problem: Survey
The Vehicle Routing Problem (VRP) is a well-known research line in the optimization
research community. Its different basic variants have been widely explored in the literature …
research community. Its different basic variants have been widely explored in the literature …
CDMO: Chaotic Dwarf Mongoose optimization algorithm for feature selection
In this paper, a modified version of Dwarf Mongoose Optimization Algorithm (DMO) for
feature selection is proposed. DMO is a novel technique of the swarm intelligence …
feature selection is proposed. DMO is a novel technique of the swarm intelligence …
A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows
This paper addresses a variant of the vehicle routing problem in which customers require
simultaneous pickup and delivery of goods during specific individual time windows …
simultaneous pickup and delivery of goods during specific individual time windows …
Metaheuristics for solving a multimodal home-healthcare scheduling problem
We present a general framework for solving a real-world multimodal home-healthcare
scheduling (MHS) problem from a major Austrian home-healthcare provider. The goal of …
scheduling (MHS) problem from a major Austrian home-healthcare provider. The goal of …
The electric autonomous dial-a-ride problem
Abstract In the Dial-a-Ride-Problem (DARP) a fleet of vehicles provides shared-ride services
to users specifying their origin, destination, and preferred arrival time. Typically, the problem …
to users specifying their origin, destination, and preferred arrival time. Typically, the problem …
Revisiting simulated annealing: A component-based analysis
Simulated Annealing (SA) is one of the oldest metaheuristics and has been adapted to solve
many combinatorial optimization problems. Over the years, many authors have proposed …
many combinatorial optimization problems. Over the years, many authors have proposed …
The waste collection vehicle routing problem with time windows in a city logistics context
Collection of waste is an important logistic activity within any city. In this paper we study how
to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem …
to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem …
Chapter 4: Heuristics for the vehicle routing problem
4.1▪ Introduction In recent years, several sophisticated mathematical programming
decomposition algorithms have been put forward for the solution of the VRP. Yet, despite …
decomposition algorithms have been put forward for the solution of the VRP. Yet, despite …
A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations
This paper contributes to the intersection of operations research and machine learning in the
context of autonomous ridesharing. In this work, autonomous ridesharing operations are …
context of autonomous ridesharing. In this work, autonomous ridesharing operations are …