Fwd: Recommended articles
1 view
Skip to first unread message
Cassius Scarpin
Apr 17, 2021, 10:40:36 AM4/17/21
to gtao...@googlegroups.com
coisas interessantes ai
See all recommendations
--
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: sáb., 17 de abr. de 2021 às 11:14
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: sáb., 17 de abr. de 2021 às 11:14
Subject: Recommended articles
To: <cass...@gmail.com>
Capacitated Location Routing Problem with Simultaneous Pickup and Delivery under the Risk of Disruption
M Dehghan, SR Hejazi, MK Mamaghan…
This paper develops a new mathematical model to study a location-routing problem
with simultaneous pickup and delivery under the risk of disruption. A remarkable
number of previous studies have assumed that network components (eg, routes …
with simultaneous pickup and delivery under the risk of disruption. A remarkable
number of previous studies have assumed that network components (eg, routes …
 |  |  |  |
A dynamic optimisation approach for a single machine scheduling problem with machine conditions and maintenance decisions
W Yang, L Chen, S Dauzère-Pèrés - International Journal of Production Research, 2021
In modern production systems, considering machine conditions is becoming
essential to achieving an overall optimisation of the production schedule. This paper
studies a single machine scheduling problem, where the actual processing times of …
essential to achieving an overall optimisation of the production schedule. This paper
studies a single machine scheduling problem, where the actual processing times of …
| | | |
An efficient Variable Neighborhood Search for the Space-Free Multi-Row Facility Layout problem
A Herrán, JM Colmenar, A Duarte - European Journal of Operational Research, 2021
Abstract The Space-Free Multi-Row Facility Layout problem (SF-MRFLP) seeks for a
non-overlapping layout of departments (facilities) on a given number of rows
satisfying the following constraints: no space is allowed between two adjacent …
non-overlapping layout of departments (facilities) on a given number of rows
satisfying the following constraints: no space is allowed between two adjacent …
| | | |
[PDF] A solution approach for multi-trip vehicle routing problems with time windows, fleet sizing, and depot location
PF Cueto, I Gjeroska, AS Vilalta, MF Anjos - 2021
We present a solution approach for a multi-trip vehicle routing problem with time
windows in which the locations of a prescribed number of depots and the fleet sizes
must also be optimized. Given the complexity of the task, we divide the problem into …
windows in which the locations of a prescribed number of depots and the fleet sizes
must also be optimized. Given the complexity of the task, we divide the problem into …
| | | |
GRASP with ALNS for solving the location routing problem of infectious waste collection in the Northeast of Thailand
S Suksee, S Sindhuchao - International Journal of Industrial Engineering …, 2021
This research proposes a heuristic to solve the problem of the location selection of
incinerators and the vehicle routing of infectious waste collection for hospitals in the
Northeast of Thailand. The developed heuristic is called the Greedy Randomized …
incinerators and the vehicle routing of infectious waste collection for hospitals in the
Northeast of Thailand. The developed heuristic is called the Greedy Randomized …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Tadeu Scarpin
(41) 991072942
(41) 991072942
Cassius Scarpin
Apr 20, 2021, 8:02:24 AM4/20/21
to gtao...@googlegroups.com
Mais artigos legais
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 20 de abr. de 2021 às 07:08
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 20 de abr. de 2021 às 07:08
Subject: Recommended articles
To: <cass...@gmail.com>
[HTML] A bi-objective vehicle routing problem with time windows and multiple demands
A Eydi, SA Ghasemi-Nezhad - Ain Shams Engineering Journal, 2021
In the real world, the demands for some specific goods may increase in some special
occasions. At such conditions, in-time delivery of the desired goods and minimization
of the traveling costs will be found crucial importance for the customers and the …
occasions. At such conditions, in-time delivery of the desired goods and minimization
of the traveling costs will be found crucial importance for the customers and the …
| | | |
[PDF] A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems
H Tong, LL Minku, S Menzel, B Sendhoff, X Yao - arXiv preprint arXiv:2104.06585, 2021
The capacitated arc routing problem (CARP) is a challenging combinatorial
optimisation problem abstracted from typical real-world applications, like waste
collection and mail delivery. However, few studies considered dynamic changes …
optimisation problem abstracted from typical real-world applications, like waste
collection and mail delivery. However, few studies considered dynamic changes …
| | | |
Solving the joint production distribution problem by the variable neighbourhood search algorithm
NB Mabrouk, B Jarboui, M Eddaly - … Journal of Mathematics in Operational Research, 2021
This paper addressed the dynamic integrated production routing problem where the
objective is to minimise the total cost including production, inventory and distribution.
Since this problem is NP-hard, we developed a variable neighbourhood search …
objective is to minimise the total cost including production, inventory and distribution.
Since this problem is NP-hard, we developed a variable neighbourhood search …
| | | |
[PDF] A Hybrid Local Search Framework for the Dynamic Capacitated Arc Routing Problem
H Tong, LL Minku, S Menzel, B Sendhoff, X Yao - 2021
The static capacitated arc routing problem (CARP) is a challenging combinatorial
problem, where vehicles need to be scheduled efficiently for serving a set of tasks
with minimal travelling costs. Dynamic CARP (DCARP) considers the occurence of …
problem, where vehicles need to be scheduled efficiently for serving a set of tasks
with minimal travelling costs. Dynamic CARP (DCARP) considers the occurence of …
| | | |
The Multi-Vehicle Cyclic Inventory Routing Problem: Formulation and a Metaheuristic Approach
AT WIDJAJA, A GUNAWAN, P Vansteenwegen - Computers & Industrial …, 2021
This paper presents a new variant of the Multi-Vehicle Cyclic Inventory Routing
Problem (MV-CIRP) which aims to determine a subset of customers to be visited, the
appropriate number of vehicles used, and the corresponding cycle time and route …
Problem (MV-CIRP) which aims to determine a subset of customers to be visited, the
appropriate number of vehicles used, and the corresponding cycle time and route …
| | | |
Capacitated disassembly scheduling with random demand and operation time
F Zhou, Y He, P Ma, M Lim, S Pratap - Journal of the Operational Research Society, 2021
The disassembly activity, regarding as the crucial stage in recycling operations, has
attracted increasing focus owing to the significance of eco-economics and
environmental issues. This paper examines the capacitated disassembly scheduling …
attracted increasing focus owing to the significance of eco-economics and
environmental issues. This paper examines the capacitated disassembly scheduling …
| | | |
[HTML] A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics
CC Wu, A Azzouz, JY Chen, J Xu, WL Shen, L Lu… - Complex & Intelligent …, 2021
This paper studies a single-machine multitasking scheduling problem together with
two-agent consideration. The objective is to look for an optimal schedule to minimize
the total tardiness of one agent subject to the total completion time of another agent …
two-agent consideration. The objective is to look for an optimal schedule to minimize
the total tardiness of one agent subject to the total completion time of another agent …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Scarpin
Apr 27, 2021, 10:29:21 AM4/27/21
to gtao...@googlegroups.com
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 27 de abr. de 2021 às 11:27
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 27 de abr. de 2021 às 11:27
Subject: Recommended articles
To: <cass...@gmail.com>
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
A Agra, M Christiansen, L Wolsey - European Journal of Operational Research, 2021
We consider an inventory routing problem in which a single vehicle is responsible for
the transport of a commodity from a set of supply locations to a set of demand
locations. At each location the inventory must be kept within predefined bounds, and …
the transport of a commodity from a set of supply locations to a set of demand
locations. At each location the inventory must be kept within predefined bounds, and …
| | | |
A Bilevel Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problem
YH Jia, Y Mei, M Zhang - IEEE Transactions on Cybernetics, 2021
The development of electric vehicle (EV) techniques has led to a new vehicle routing
problem (VRP) called the capacitated EV routing problem (CEVRP). Because of the
limited number of charging stations and the limited cruising range of EVs, not only …
problem (VRP) called the capacitated EV routing problem (CEVRP). Because of the
limited number of charging stations and the limited cruising range of EVs, not only …
| | | |
A metaheuristic for the Rural School Bus Routing Problem with Bell Adjustment
DM Miranda, RS de Camargo, SV Conceição, MF Porto… - Expert Systems with …, 2021
This paper addresses the school bus routing problem with bell adjustments. This
problem extends the traditional school bus routing problem by having the school
working times as decision variables instead of input data. Adjusting schools working …
problem extends the traditional school bus routing problem by having the school
working times as decision variables instead of input data. Adjusting schools working …
| | | |
[PDF] New Valid Inequalities for the Symmetric Vehicle Routing Problem with Simultaneous Pickup and Deliveries
YK Agarwal, P Venkateshan - 2021
The symmetric vehicle routing problem with simultaneous pickup and deliveries is
considered. The current state-of-the-art method to solve this problem employs the
idea of a no-good cut. This paper achieves an order of magnitude improvement in …
considered. The current state-of-the-art method to solve this problem employs the
idea of a no-good cut. This paper achieves an order of magnitude improvement in …
| | | |
Multi-depot vehicle routing problem with split delivery and traffic restriction: Variable neighborhood search algorithm
M Hajikhani, J Behnamian - Modern Research in Decision Making, 2021
The purpose of solving the problem of vehicle routing is to find a suitable route taking
into account the existing conditions in the transportation problem. In this case,
considering the routing conditions with several depots along with imposing traffic …
into account the existing conditions in the transportation problem. In this case,
considering the routing conditions with several depots along with imposing traffic …
| | | |
A new method for a class of parallel batch machine scheduling problem
W Jiang, Y Shen, L Liu, X Zhao, L Shi - Flexible Services and Manufacturing Journal, 2021
This paper studies the scheduling problem of jobs with release times, non-identical
sizes, and incompatible job families on unrelated parallel batch machines. The
capacities of batch machines and the processing times of each job on the batch …
sizes, and incompatible job families on unrelated parallel batch machines. The
capacities of batch machines and the processing times of each job on the batch …
| | | |
Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search
T Alves de Queiroz, M Iori, A Kramer, YH Kuo - 8th International Conference on …, 2021
The dynamic scheduling of patients to doctors in an emergency department
environment is tackled in this work. We consider the case in which patients arrive
dynamically during the working hours, and the objective is to minimize the weighted …
environment is tackled in this work. We consider the case in which patients arrive
dynamically during the working hours, and the objective is to minimize the weighted …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Scarpin
May 4, 2021, 10:11:31 AM5/4/21
to gtao...@googlegroups.com
Mais alguns artigos legais ai...
Tem até de colônia de Abelhas
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 4 de mai. de 2021 às 11:03
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 4 de mai. de 2021 às 11:03
Subject: Recommended articles
To: <cass...@gmail.com>
[PDF] A two-echelon supply chain model with price and warranty dependent demand and pro-rata warranty policy under cost sharing contract
B Samanta, BC Giri - Decision Making: Applications in Management and …, 2021
In this article, a two-echelon supply chain model with a single-vendor a single-buyer
is considered. The vendor's production process is imperfect and the market demand
is assumed to be dependent on the buyer's selling price and warranty period. The …
is considered. The vendor's production process is imperfect and the market demand
is assumed to be dependent on the buyer's selling price and warranty period. The …
| | | |
[PDF] NEW HYBRID SEARCH FOR THE CAPACITATED VEHICLE ROUTING PROBLEM
N Elgharably, A Nassef, S Easa, A El-Damatty - 2021
The vehicle routing problem is one of the most studied combinatorial optimization
problems in operations research. The problem deals with a homogenous fleet of
capacitated vehicles that operates from a central depot serving a set of customers …
problems in operations research. The problem deals with a homogenous fleet of
capacitated vehicles that operates from a central depot serving a set of customers …
| | | |
[PDF] Heuristic Approach For Robust Counterpart Open Capacitated Vehicle Routing Problem With Time Windows
E Yuliza, FM Puspita, SS Supadi - Science and Technology Indonesia, 2021
Garbage is one of the environmental problems. The process of transporting garbage
sometimes occurs delays such as congestion and engine failure. Robust
optimization model called a robust counterpart open capacitated vehicle routing …
sometimes occurs delays such as congestion and engine failure. Robust
optimization model called a robust counterpart open capacitated vehicle routing …
| | | |
Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
W Wang - Journal of Applied Mathematics and Computing, 2021
This paper studies the single-machine due-date assignment problem with past-
sequence-dependent setup times (denoted by\(ST_ {psd}\)). Under common due-
date (denoted by CON-DD) assignment, slack due-date (denoted by SLK-DD) and …
sequence-dependent setup times (denoted by\(ST_ {psd}\)). Under common due-
date (denoted by CON-DD) assignment, slack due-date (denoted by SLK-DD) and …
| | | |
Effects of memory and genetic operators on Artificial Bee Colony algorithm for Single Container Loading problem
T Bayraktar, F Ersöz, C Kubat - Applied Soft Computing, 2021
Abstract The Artificial Bee Colony (ABC) algorithm is widely used to achieve optimum
solution in a short time in integer-based optimization problems. However, the
complexity of integer-based problems such as Knapsack Problems (KP) requires …
solution in a short time in integer-based optimization problems. However, the
complexity of integer-based problems such as Knapsack Problems (KP) requires …
| | | |
[PDF] Sustainable Operations and Computers
M Mahjoob, SS Fazeli, LS Tavassoli, M Mirmozaffari…
abstract In this study, we proposes a multi-period inventory routing problem with
pickup and split delivery for distributing flour among bakeries. This study aims to
determine the routes for heterogeneous vehicles with different loading capacity and …
pickup and split delivery for distributing flour among bakeries. This study aims to
determine the routes for heterogeneous vehicles with different loading capacity and …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Scarpin
May 10, 2021, 12:58:51 PM5/10/21
to gtao...@googlegroups.com
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: sáb., 8 de mai. de 2021 às 16:06
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: sáb., 8 de mai. de 2021 às 16:06
Subject: Recommended articles
To: <cass...@gmail.com>
The target visitation arc routing problem
J Rodríguez-Pereira, G Laporte - TOP, 2021
This paper studies the target visitation arc routing problem on an undirected graph.
This problem combines the well-known undirected rural postman problem and the
linear ordering problem. In this problem, there is a set of required edges partitioned …
This problem combines the well-known undirected rural postman problem and the
linear ordering problem. In this problem, there is a set of required edges partitioned …
| | | |
Multi-period two-echelon location routing problem for disaster waste clean-up
C Cheng, R Zhu, AM Costa, RG Thompson, X Huang - Transportmetrica A: Transport …, 2021
Waste clean-up after a disaster is one of the most critical tasks in the response stage
of disaster management. We develop a model to minimise the cost and duration of
disaster waste clean-up considering using Temporary Disaster Waste Management …
of disaster management. We develop a model to minimise the cost and duration of
disaster waste clean-up considering using Temporary Disaster Waste Management …
| | | |
A novel risk perspective on location-routing planning: An application in cash transportation
S Allahyari, S Yaghoubi, T Van Woensel - Transportation Research Part E: Logistics …, 2021
The critical role of supply chain security for businesses and government agencies
has resulted in significant efforts over the last two decades to reduce vulnerability or
disruption in supply chains. This paper addresses the routing problem of security …
has resulted in significant efforts over the last two decades to reduce vulnerability or
disruption in supply chains. This paper addresses the routing problem of security …
| | | |
A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs
F Ozcelik, M Ertem, T Saraç - Engineering Optimization, 2021
In the injection moulding process, a set-up containing positioning moulds, a cleaning
raw material hopper and machine settings is required. The set-up is uncertain owing
to random factors, such as the crew's skill levels and unexpected breakdowns. The …
raw material hopper and machine settings is required. The set-up is uncertain owing
to random factors, such as the crew's skill levels and unexpected breakdowns. The …
| | | |
Time-dependent rural postman problem: time-space network formulation and genetic algorithm
J Xin, B Yu, A D'Ariano, H Wang, M Wang - Operational Research, 2021
In this paper, a new time-space network model is proposed for addressing the time-
dependent rural postman problem (TDRPP) of a single vehicle. The proposed model
follows the idea of arc-path alternation to form a feasible and complete route. Based …
dependent rural postman problem (TDRPP) of a single vehicle. The proposed model
follows the idea of arc-path alternation to form a feasible and complete route. Based …
| | | |
[PDF] A Hybrid Genetic-Simulated Annealing-Auction Algorithm for a Fully Fuzzy Multi-Period Multi-Depot Vehicle Routing Problem
M Saffarian, M Niksirat, SM Kazemi - International Journal of Supply and Operations …, 2021
In this paper, an integer linear programming formulation is developed for a novel
fuzzy multi-period multi-depot vehicle routing problem. The novelty belongs to both
the model and the solution methodology. In the proposed model, vehicles are not …
fuzzy multi-period multi-depot vehicle routing problem. The novelty belongs to both
the model and the solution methodology. In the proposed model, vehicles are not …
| | | |
Deploying autonomous mobile lockers in a two-echelon parcel operation
J Li, H Ensafian, MGH Bell, DG Geers - Transportation Research Part C: Emerging …, 2021
Abstract In this study, Autonomous Mobile Lockers (AMLs) are introduced into current
city logistics networks to reduce traffic congestion and save cost. The proposed
system consists of couriers working with AMLs that visit the couriers in the field and …
city logistics networks to reduce traffic congestion and save cost. The proposed
system consists of couriers working with AMLs that visit the couriers in the field and …
| | | |
S Suksee, S Sindhuchao - International Journal of Industrial Engineering …, 2021
This research proposes a heuristic to solve the problem of the location selection of
incinerators and the vehicle routing of infectious waste collection for hospitals in the
Northeast of Thailand. The developed heuristic is called the Greedy Randomized …
incinerators and the vehicle routing of infectious waste collection for hospitals in the
Northeast of Thailand. The developed heuristic is called the Greedy Randomized …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Scarpin
May 11, 2021, 10:19:15 AM5/11/21
to gtao...@googlegroups.com
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 11 de mai. de 2021 às 10:03
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 11 de mai. de 2021 às 10:03
Subject: Recommended articles
To: <cass...@gmail.com>
[HTML] Hybridizing Large Neighborhood Search and Exact Methods for Generalized Vehicle Routing Problems with Time Windows (Revision 2)
D Dumez, C Tilk, S Irnich, F Lehuédé, O Péton - EURO Journal on Transportation and …, 2021
Delivery options are at the heart of the generalized vehicle routing problem with time
windows (GVRPTW) allowing that customer requests are shipped to alternative
delivery locations which can also have different time windows. Recently, the vehicle …
windows (GVRPTW) allowing that customer requests are shipped to alternative
delivery locations which can also have different time windows. Recently, the vehicle …
| | | |
[HTML] The Vehicle Routing Problem with relaxed priority rules
TT Doan, N Bostel, MH Hà - EURO Journal on Transportation and Logistics, 2021
Abstract The Vehicle Routing Problem (VRP) is one of the most studied topics in
Operations Research. Among the numerous variants of the VRP, this research
addresses the VRP with relaxed priority rules (VRP-RPR) in which customers are …
Operations Research. Among the numerous variants of the VRP, this research
addresses the VRP with relaxed priority rules (VRP-RPR) in which customers are …
| | | |
Dynamic scheduling in make-to-stock production systems with setup times and random breakdowns: performance analysis and improved policies
F Tubilla, SB Gershwin - International Journal of Production Research, 2021
We study the scheduling of production in a multi-item, failure-prone machine with
setup times, with the objective of minimising long-run average inventory and backlog
costs. We make two contributions to this problem, which has received significantly …
setup times, with the objective of minimising long-run average inventory and backlog
costs. We make two contributions to this problem, which has received significantly …
| | | |
[HTML] A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout
M Zhang, G Xiong, S Bao, C Meng - Journal of Industrial & Management Optimization, 2021
Based on the rapid development of e-commerce, major promotional events and
holidays can lead to explosive growth in market demand and place significant
pressure on distribution systems. In this study, we considered a distribution system in …
holidays can lead to explosive growth in market demand and place significant
pressure on distribution systems. In this study, we considered a distribution system in …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Scarpin
May 18, 2021, 12:23:02 PM5/18/21
to gtao...@googlegroups.com
Parece que os lobos cinzas estão ficando na moda.... bom para nós...
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 18 de mai. de 2021 às 08:38
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: ter., 18 de mai. de 2021 às 08:38
Subject: Recommended articles
To: <cass...@gmail.com>
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
X Lai, JK Hao, ZH Fu, D Yue - Computers & Operations Research, 2021
The capacitated clustering problem (CCP) is a general model relevant for a variety of
important applications in areas such as parallel computing and very large scale
integration design. However, the problem is known to be NP-hard, and thus …
important applications in areas such as parallel computing and very large scale
integration design. However, the problem is known to be NP-hard, and thus …
| | | |
Robust optimization for the hierarchical mixed capacitated general routing problem applied to winter road maintenance
C Ahabchane, A Langevin, M Trépanier - Computers & Industrial Engineering, 2021
This paper studies the Mixed Capacitated General Routing Problem (MCGRP) under
demand uncertainty and service hierarchy using a robust optimization approach. The
problem is motivated by an industrial problem: the winter road salt spreading with …
demand uncertainty and service hierarchy using a robust optimization approach. The
problem is motivated by an industrial problem: the winter road salt spreading with …
| | | |
[PDF] Grey Wolf Optimizer algorithm for solving the multi depot vehicle routing problem and its implementation
D Diastivena, S Wahyuningsih, D Satyananda - Journal of Physics: Conference …, 2021
Abstract Multi Depot Vehicle Routing Problem (MDVRP) is one of Vehicle Routing
Problem (VRP) variants. MDVRP is a VRP that uses more than one depot for the
distribution process. In this paper, the MDVRP will be solved using the Grey Wolf …
Problem (VRP) variants. MDVRP is a VRP that uses more than one depot for the
distribution process. In this paper, the MDVRP will be solved using the Grey Wolf …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Cassius Scarpin
May 22, 2021, 8:35:06 AM5/22/21
to gtao...@googlegroups.com
---------- Forwarded message ---------
De: Google Scholar Alerts <scholarale...@google.com>
Date: sáb., 22 de mai. de 2021 às 08:49
Subject: Recommended articles
To: <cass...@gmail.com>
De: Google Scholar Alerts <scholarale...@google.com>
Date: sáb., 22 de mai. de 2021 às 08:49
Subject: Recommended articles
To: <cass...@gmail.com>
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
P Keenan, J Panadero, AA Juan, R Martí… - Computers & Operations …, 2021
Abstract The Time Capacitated Arc Routing Problem (TCARP) extends the classical
Capacitated Arc Routing Problem by considering time-based capacities instead of
traditional loading capacities. In the TCARP, the costs associated with traversing and …
Capacitated Arc Routing Problem by considering time-based capacities instead of
traditional loading capacities. In the TCARP, the costs associated with traversing and …
| | | |
The Multi-visit Traveling Salesman Problem with Multi-Drones
Z Luo, M Poon, Z Zhang, Z Liu, A Lim - Transportation Research Part C: Emerging …, 2021
The use of drones for parcel delivery has recently attracted wide attention due to its
potential in improving efficiency of the last-mile delivery. Though attempts have been
made on combined truck-drone delivery to deploy multiple drones that can deliver …
potential in improving efficiency of the last-mile delivery. Though attempts have been
made on combined truck-drone delivery to deploy multiple drones that can deliver …
| | | |
Single batch machine scheduling with dual setup times for autoclave molding manufacturing
S Zheng, N Xie, Q Wu - Computers & Operations Research, 2021
Batch scheduling involves a machine that can process several jobs simultaneously.
The existing literature mainly focuses on the batch-size-dependent setup time.
However, setup time depends not only on the batch size but also on technological …
The existing literature mainly focuses on the batch-size-dependent setup time.
However, setup time depends not only on the batch size but also on technological …
| | | |
Impact of uncertain demand and lead-time reduction on two-echelon supply chain
S Sarkar, S Tiwari, BC Giri - Annals of Operations Research, 2021
This paper develops a continuous-review vendor-buyer supply chain (SC) model
wherein the lead-time (taken as replenished) is considered as a factor affected upon
by the time stamp required for setup and production followed by transportation. Here …
wherein the lead-time (taken as replenished) is considered as a factor affected upon
by the time stamp required for setup and production followed by transportation. Here …
| | | |
[PDF] Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets
PN Ky Phuc, NL Phuong Thao - Logistics, 2021
This study focuses on solving the vehicle routing problem (VRP) of E-logistics service
providers. In our problem, each vehicle must visit some pick up nodes first, for
instance, warehouses to pick up the orders then makes deliveries for customers in …
providers. In our problem, each vehicle must visit some pick up nodes first, for
instance, warehouses to pick up the orders then makes deliveries for customers in …
| | | |
[PDF] Hub Location, Routing and Route Dimensioning: Strategic and Tactical Intermodal Transportation Hub Network Design
B Yildiz, H Yaman, O Ekin Karasan - Transportation Science, 2021
We propose a novel hub location model that jointly eliminates some of the traditional
assumptions on the structure of the network and on the discount due to economies of
scale in an effort to better reflect real-world logistics and transportation systems. Our …
assumptions on the structure of the network and on the discount due to economies of
scale in an effort to better reflect real-world logistics and transportation systems. Our …
| | | |
[PDF] A Neighbourhood Search for Artificial Bee Colony in Vehicle Routing Problem with Time Windows
S Mortada, Y Yusof
Artificial bee colony (ABC) is one of the widely used swarm intelligence algorithms in
solving combinatorial optimization problems. In this study, the existing Modified ABC
(MABC) algorithm is revised to solve the vehicle routing problem with time windows …
solving combinatorial optimization problems. In this study, the existing Modified ABC
(MABC) algorithm is revised to solve the vehicle routing problem with time windows …
| | | |
See all recommendations
This message was sent by Google Scholar because you're following new recommended articles for your profile.
Reply all
Reply to author
Forward
0 new messages