Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Nicola Bianchessi"'
Autor:
Nicola Bianchessi
Publikováno v:
Networks. 81:499-513
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb6b52991b82f756167442ae4bdacfdd
https://doi.org/10.1002/net.22145
https://doi.org/10.1002/net.22145
Publikováno v:
European Journal of Operational Research. 300:837-851
Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, since they can serve them from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21eee4f10596ffd09e2ab385b61a5dd2
https://doi.org/10.1016/j.ejor.2021.10.047
https://doi.org/10.1016/j.ejor.2021.10.047
Publikováno v:
Discrete Applied Mathematics. 288:152-170
The multiple vehicle traveling purchaser problem (MVTPP) consists of simultaneously selecting suppliers and routing a fleet of homogeneous vehicles to purchase different products at the selected suppliers so that all product demands are fulfilled and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::738b5c74e5193055c38a041bb97f687b
https://doi.org/10.1016/j.dam.2020.08.014
https://doi.org/10.1016/j.dam.2020.08.014
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
Publikováno v:
European Journal of Operational Research. 278:91-104
In the commodity-constrained split delivery vehicle routing problem (C-SDVRP), customer demands are composed of sets of different commodities. The C-SDVRP asks for a minimum-distance set of routes such that all customer demands are met and vehicle ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::272a00421a04cf20c35d6352fe241278
https://doi.org/10.1016/j.ejor.2019.04.008
https://doi.org/10.1016/j.ejor.2019.04.008
Autor:
Nicola Bianchessi, Stefan Irnich
Publikováno v:
Transportation Science. 53:442-462
The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c3e4cd1bc45e0923945f0ffcbe56eef
https://doi.org/10.1287/trsc.2018.0825
https://doi.org/10.1287/trsc.2018.0825
Publikováno v:
Computers & Operations Research. 140:105653
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::174b11d50ff1fee05be148e1c277ced5
https://doi.org/10.1016/j.cor.2021.105653
https://doi.org/10.1016/j.cor.2021.105653
Publikováno v:
Transportation Science, 54(2), 470-487. INFORMS Inst.for Operations Res.and the Management Sciences
Orlis, C, Bianchessi, N, Roberti, R & Dullaert, W 2020, ' The team orienteering problem with overlaps : An application in cash logistics ', Transportation Science, vol. 54, no. 2, pp. 470-487 . https://doi.org/10.1287/trsc.2019.0923
Orlis, C, Bianchessi, N, Roberti, R & Dullaert, W 2020, ' The team orienteering problem with overlaps : An application in cash logistics ', Transportation Science, vol. 54, no. 2, pp. 470-487 . https://doi.org/10.1287/trsc.2019.0923
The team orienteering problem (TOP) aims at finding a set of routes subject to maximum route duration constraints that maximize the total collected profit from a set of customers. Motivated by a real-life automated teller machine cash replenishment p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e4d38aa23b2e13659013dd94b626fe6
https://research.vu.nl/en/publications/5a431f20-cbe1-4237-a0ac-4df1109cf0db
https://research.vu.nl/en/publications/5a431f20-cbe1-4237-a0ac-4df1109cf0db
Publikováno v:
Transportation Science. 52:300-319
This paper presents a branch-and-price-and-cut algorithm for the exact solution of the active-passive vehicle-routing problem (APVRP). The APVRP covers a range of logistics applications where pickup-and-delivery requests necessitate a joint operation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c93c463ac116f74ef0500de032f6e574
https://doi.org/10.1287/trsc.2016.0730
https://doi.org/10.1287/trsc.2016.0730
Autor:
Nicola Bianchessi, Emanuele Tresoldi
Publikováno v:
Computers & Operations Research. 136:105464
We consider a scheduling problem where a set of n jobs has to be processed in a non-preemptive way on a set of m identical parallel machines. Each job j is associated with a positive integer processing time p j . The problem is also characterized by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ed5ff56b6e0f05806526f6b4faafd7d
https://doi.org/10.1016/j.cor.2021.105464
https://doi.org/10.1016/j.cor.2021.105464
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 vehicle. In the last years, several exact methods based on different mathematical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7204146c738c5dd2a24572816d14aa1d
http://hdl.handle.net/11379/501069
http://hdl.handle.net/11379/501069