当前期刊: Networks Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Modeling the flying sidekick traveling salesman problem with multiple drones
    Networks (IF 2.602) Pub Date : 2021-01-22
    Mauro Dell'Amico; Roberto Montemanni; Stefano Novellani

    This article considers a version of the flying sidekick traveling salesman problem in which parcels are delivered to customers by either a truck or a set of identical flying drones. The flights of the drones are limited by the battery endurance and each flight is made of a launch, a service to a customer, and a return: launch and return must happen when the truck is stationary. These operations require

    更新日期:2021-01-22
  • Controller placement problem in software‐defined networking: A survey
    Networks (IF 2.602) Pub Date : 2021-01-21
    Abha Kumari; Ashok Singh Sairam

    A distinctive feature of software‐defined networking (SDN) is a logically centralized control plane realized using multiple physical controllers. The placement of the controllers, the so‐called controller placement problem (CPP), is a crucial design issue. It influences network performance parameters such as latency, flow setup time, network availability, load balance of the controllers, and energy

    更新日期:2021-01-21
  • An extreme‐point tabu‐search algorithm for fixed‐charge network problems
    Networks (IF 2.602) Pub Date : 2021-01-19
    Richard S. Barr; Fred Glover; Toby Huskinson; Gary Kochenberger

    We propose a new algorithm for fixed‐charge network flow problems based on ghost image (GI) processes as proposed in Glover (1994) and adapted to fixed‐charge transportation problems in Glover et al. (2005). Our GI algorithm iteratively modifies an idealized representation of the problem embodied in a parametric GI, enabling all steps to be performed with a primal network flow algorithm operating on

    更新日期:2021-01-20
  • A Lagrangean relaxation approach to lifetime maximization of directional sensor networks
    Networks (IF 2.602) Pub Date : 2021-01-14
    Annabella Astorino; Manlio Gaudioso; Giovanna Miglionico

    We consider the directional sensor network lifetime maximization problem (DSLMP). Given a set of directional sensor and target locations, the problem consists in assigning, at each time unit of a given time horizon, the action radius, the aperture angle, and the orientation direction to all sensors. The objective is to maximize the number of time units when all targets are covered, under certain constraints

    更新日期:2021-01-14
  • Deciding feasibility of a booking in the European gas market on a cycle is in P for the case of passive networks
    Networks (IF 2.602) Pub Date : 2021-01-05
    Martine Labbé; Fränk Plein; Martin Schmidt; Johannes Thürauf

    We show that the feasibility of a booking in the European entry‐exit gas market can be decided in polynomial time on single‐cycle networks that are passive, i.e., do not contain controllable elements. The feasibility of a booking can be characterized by solving polynomially many nonlinear potential‐based flow models for computing so‐called potential‐difference maximizing load flow scenarios. We thus

    更新日期:2021-01-05
  • Trucks and drones cooperation in the last‐mile delivery process
    Networks (IF 2.602) Pub Date : 2020-12-24
    Luigi Di Puglia Pugliese; Giusy Macrina; Francesca Guerriero

    We address the problem of routing a fleet of trucks equipped with unmanned aerial vehicles, commonly known as drones, to perform deliveries in last‐mile delivery process. The customers can be served by either a truck or a drone within the respective time window of each. Each capacitated truck carries drones that can be launched to perform deliveries. The drone takes off from a truck located either

    更新日期:2020-12-24
  • Optimizing concurrency under Scheduling by Edge Reversal
    Networks (IF 2.602) Pub Date : 2020-12-22
    Carlos E. Marciano; Gladstone M. Arantes; Abilio Lucena; Luidi G. Simonetti; Luerbio Faria; Felipe M. G. França

    Scheduling by Edge Reversal provides an order of operation for nodes in a graph, but maximizing or minimizing the resulting concurrency is hard. In this paper, we discuss a series of real‐world applications for this technique and propose algorithms for both problems. For maximum concurrency, we prove its general inapproximability and introduce approximation algorithms for classes of graphs. For minimum

    更新日期:2020-12-22
  • Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations
    Networks (IF 2.602) Pub Date : 2020-12-16
    Riccardo Giusti; Daniele Manerba; Roberto Tadei

    The transshipment location–allocation problem consists of locating transshipment facilities (e.g., intermodal hubs) of a transportation network and allocating freight flows through them, from several origins to several destinations, to satisfy demand and supply constraints. The objective is to maximize the total net transportation utility given by the total shipping utility minus the total cost to

    更新日期:2020-12-16
  • Generating large scale‐free networks with the Chung–Lu random graph model
    Networks (IF 2.602) Pub Date : 2020-12-08
    Dario Fasino; Arianna Tonetto; Francesco Tudisco

    Random graph models are a recurring tool‐of‐the‐trade for studying network structural properties and benchmarking community detection and other network algorithms. Moreover, they serve as test‐bed generators for studying diffusion and routing processes on networks. In this paper, we illustrate how to generate large random graphs having a power‐law degree distribution using the Chung–Lu model. In particular

    更新日期:2020-12-08
  • The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
    Networks (IF 2.602) Pub Date : 2020-12-06
    Francesco Carrabs; Ciriaco D'Ambrosio; Daniele Ferone; Paola Festa; Federica Laureana

    This paper deals with the Constrained Forward Shortest Path Tour Problem, an NP‐complete variant of the Forward Shortest Path Tour Problem. Given a directed weighted graph G = (V, A), where the set of nodes V is partitioned into clusters T1, …, TN, the aim is determining a shortest path between two given nodes, s and d, with the properties that clusters must be visited according to a given order, and

    更新日期:2020-12-07
  • Unimodal eccentricity in trees
    Networks (IF 2.602) Pub Date : 2020-12-05
    Jökull S. Gylfason; Bernhard L. Hilmarsson; Tigran Tonoyan

    Jordan's classic theorem states that the center of every tree (the set of minimum eccentricity vertices) forms a complete subgraph. This property, which we refer to as the “Jordan property,” has been established for various definitions of eccentricity, the most popular being the maximum and average distances of a vertex to the others. In this note, we consider unimodal eccentricity functions, such

    更新日期:2020-12-05
  • A two‐step optimization model for the distribution of perishable products
    Networks (IF 2.602) Pub Date : 2020-12-01
    Mauro Gaggero; Flavio Tonelli

    Optimal planning for distribution networks of perishable products is addressed by means of a two‐step approach pursuing both strategic and tactical goals. The distribution network is represented as a directed graph, and discrete‐time dynamic equations are devised to model the storage and transportation of products. The first decision step consists of an optimization problem to account for a strategic

    更新日期:2020-12-01
  • A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
    Networks (IF 2.602) Pub Date : 2020-11-27
    Francesco Carrabs; Manlio Gaudioso

    This article addresses the minimum spanning tree problem with conflicting edge pairs, a variant of the classical minimum spanning tree where, given a list of conflicting edges, the goal is to find the cheapest spanning tree with no edges in conflict. We adopt a Lagrangian relaxation approach together with a dual ascent and a subgradient procedure to find tight lower bounds on the optimal solution.

    更新日期:2020-11-27
  • Solving Steiner trees: Recent advances, challenges, and perspectives
    Networks (IF 2.602) Pub Date : 2020-11-27
    Ivana Ljubić

    The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming,

    更新日期:2020-11-27
  • Packing returning secretaries
    Networks (IF 2.602) Pub Date : 2020-11-26
    Martin Hoefer; Lisa Wilhelmi

    We study online secretary problems with returns in combinatorial packing domains with n candidates that arrive sequentially over time in random order. The goal is to determine a feasible packing of candidates of maximum total value. In the first variant, each candidate arrives exactly twice. All 2n arrivals occur in random order. We propose a simple 0.5‐competitive algorithm. For the online bipartite

    更新日期:2020-11-27
  • A fast maximum flow algorithm
    Networks (IF 2.602) Pub Date : 2020-11-26
    James B. Orlin; Xiao‐yue Gong

    In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new variant of the excess scaling algorithm for the max flow problem whose running time strictly

    更新日期:2020-11-27
  • The Gross–Saccoman conjecture is true
    Networks (IF 2.602) Pub Date : 2020-11-24
    Pablo Romero

    Consider a graph with perfect nodes but independent edge failures with identical probability ρ. The reliability is the connectedness probability of the random graph. A graph with n nodes and e edges is uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the same number of nodes and edges, for all values of ρ. In 1997, Gross and Saccoman proved that the simple

    更新日期:2020-11-25
  • Roots of two‐terminal reliability polynomials
    Networks (IF 2.602) Pub Date : 2020-11-16
    Jason Brown; Corey D. C. DeGagné

    Assume that the vertices of a graph G are always operational, but the edges of G are operational independently with probability p ∈ [0, 1]. For fixed vertices s and t, the two‐terminal reliability of G is the probability that the operational subgraph contains an (s, t)‐path, while the all‐terminal reliability of G is the probability that the operational subgraph contains a spanning tree. Both reliabilities

    更新日期:2020-11-18
  • “Make no little plans”: Impactful research to solve the next generation of transportation problems
    Networks (IF 2.602) Pub Date : 2020-11-16
    Niels Agatz; Mike Hewitt; Barrett W. Thomas

    The transportation science research community has contributed to numerous practical and intellectual innovations and improvements over the last decades. Technological advancements have broadened and amplified the potential impacts of our field. At the same time, the world and its communities are facing greater and more serious challenges than ever before. In this paper, we call upon the transportation

    更新日期:2020-11-16
  • An efficient approach to optimization of semi‐stable routing in multicommodity flow networks
    Networks (IF 2.602) Pub Date : 2020-11-10
    Artur Tomaszewski; Michał Pióro; Davide Sanvito; Ilario Filippini; Antonio Capone

    Ideally, the network should be dynamically reconfigured as traffic evolves. Yet, even within the software defined network paradigm, network reconfigurations cannot be too frequent due to a number of reasons related to route consistency, forwarding rules instantiation, individual flows dynamics, traffic monitoring overhead, and so on. In this paper, we focus on the fundamental issue of deciding whether

    更新日期:2020-11-12
  • Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
    Networks (IF 2.602) Pub Date : 2020-09-25
    Georg E. A. Fröhlich; Karl F. Doerner; Margaretha Gansterer

    Many security companies offer patrolling services, such that guards inspect facilities or streets on a regular basis. Patrolling routes should be cost efficient, but the inspection patterns should not be predictable for offenders. We introduce this setting as a multi‐objective periodic mixed capacitated general routing problem with objectives being cost minimization and route inconsistency maximization

    更新日期:2020-11-02
  • Plowing with precedence in polynomial time
    Networks (IF 2.602) Pub Date : 2020-08-28
    Rodrigo A. Castro Campos; Cynthia A. Rodríguez Villalobos; Francisco Javier Zaragoza Martínez

    The plowing with precedence problem is a variant of the windy postman problem, where a plow is required to clean streets after a heavy snowfall with traversing costs depending on the direction of traversal as well as whether a street has been previously plowed or not. We prove that this problem can be solved in polynomial time under natural cost structures. We also propose heuristics for this problem

    更新日期:2020-11-02
  • The mixed capacitated general routing problem with time‐dependent demands
    Networks (IF 2.602) Pub Date : 2020-09-09
    Chahid Ahabchane; André Langevin; Martin Trépanier

    The mixed capacitated general routing problem (MCGRP) is defined over a mixed graph, for which some nodes, arcs, and edges must be serviced. The problem consists of determining a set of routes of minimum cost that satisfy the demand. Some problems like salt spreading have a time‐dependent demand which was ignored in the previous studies. This variation of demand is due to the weather or traffic conditions

    更新日期:2020-11-02
  • On approximate data reduction for the Rural Postman Problem: Theory and experiments
    Networks (IF 2.602) Pub Date : 2020-10-06
    René van Bevern; Till Fluschnik; Oxana Yu. Tsidulko

    Given an undirected graph with edge weights and a subset R of its edges, the Rural Postman Problem (RPP) is to find a closed walk of minimum total weight containing all edges of R. We prove that RPP is WK[1]‐complete parameterized by the number and weight d of edges traversed additionally to the required ones. Thus RPP instances cannot be polynomial‐time compressed to instances of size polynomial in

    更新日期:2020-11-02
  • A branch‐and‐dive heuristic for single vehicle snow removal
    Networks (IF 2.602) Pub Date : 2020-09-07
    Roghayeh Hajizadeh; Kaj Holmberg

    This paper deals with planning of a tour for a vehicle to clear a certain set of streets in a city of snow. Our previous results on the problem contain a heuristic based on reformulation to an asymmetric traveling salesman problem (ATSP) which yields feasible solutions and upper bounds, and a relaxation of a MIP model for obtaining lower bounds. The goal now is to try to improve the solutions and bounds

    更新日期:2020-11-02
  • Effects of update frequencies in a dynamic capacitated arc routing problem
    Networks (IF 2.602) Pub Date : 2020-09-16
    Wasin Padungwech; Jonathan Thompson; Rhyd Lewis

    The capacitated arc routing problem (CARP) concerns a minimum‐cost set of routes for vehicles that provide service on edges in a given graph while ensuring that the total demand in each route does not exceed the vehicle's capacity. This paper concerns a dynamic variant of the CARP. In particular, it focuses on a problem in which new tasks appear over time. We find that simply increasing the number

    更新日期:2020-11-02
  • The parking warden tour problem
    Networks (IF 2.602) Pub Date : 2020-09-03
    Maurizio Bruglieri

    In this work we introduce the parking warden tour problem (PWTP), a new arc routing problem arising in irregular parking detection to model the maximization of the fines collected by a team of parking wardens. The peculiarity of the PWTP is that the arc revenue depends on the time elapsed from the previous inspection of a warden, since the revenue on a road link slumps to zero if a warden has just

    更新日期:2020-11-02
  • A story of diameter, radius, and (almost) Helly property
    Networks (IF 2.602) Pub Date : 2020-10-16
    Guillaume Ducoffe; Feodor F. Dragan

    We present new algorithmic results for the class of Helly graphs, that is, for the discrete analogues of hyperconvex metric spaces. Specifically, an undirected unweighted graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. It is known that every graph isometrically embeds into a Helly graph that makes of the latter an important class of graphs in metric

    更新日期:2020-10-17
  • Telecommunications network design: Technology impacts and future directions
    Networks (IF 2.602) Pub Date : 2020-10-16
    Richard T. Wong

    During the past 50 years telecommunication network technology has raced ahead powered by exponential advances in computer chip and fiber optic technology. The introduction of packet‐switched networks and the Internet has increased network traffic demands exponentially and has nurtured a variety of new telecommunication services (e.g., email, web‐surfing, social media, streaming services, e‐commerce

    更新日期:2020-10-17
  • In search of network resilience: An optimization‐based view
    Networks (IF 2.602) Pub Date : 2020-10-08
    Thomas C. Sharkey; Sarah G. Nurre Pinkley; Daniel A. Eisenberg; David L. Alderson

    Fifty years of research in Networks coincides with 50 years of advances in resilience theory and applications. The purpose of this review is to identify how these two technical communities influenced each other in the past and can bolster each other in the future. Advances in resilience theory show that there are at least four ways networks demonstrate resilience: robustness, rebound, extensibility

    更新日期:2020-10-08
  • Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
    Networks (IF 2.602) Pub Date : 2020-10-06
    Claudia Archetti; Luca Bertazzi

    In the e‐commerce era, vendors have to satisfy a large number of on‐line orders, mainly from private customers, with low weight and volume, reduced delivery time, and overlap of customers' time windows. Production is made available all day long. New strategies and new technologies are emerging for deliveries. The processing time of the orders is reduced. These new features generate interesting challenges

    更新日期:2020-10-07
  • A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
    Networks (IF 2.602) Pub Date : 2020-09-28
    Jérémy Omer; Michael Poss

    We consider a time‐dependent shortest path problem with possible waiting at some nodes of the graph and a global bound W on the total waiting time. The goal is to minimize the time traveled along the edges of the path, not including the waiting time. We prove that the problem can be solved in polynomial time when the travel time functions are piecewise linear and continuous. The algorithm relies on

    更新日期:2020-09-28
  • Efficient algorithms for finding 2‐medians of a tree
    Networks (IF 2.602) Pub Date : 2020-09-21
    Aissa Oudjit; Matthias F. Stallmann

    The p‐median problem for networks is NP‐hard, but polynomial time algorithms exist for trees (n is the number of nodes): O(pn2) by Tamir, and O(n lgp + 2 n) by Benkoczi and Bhattacharya. Goldman gave an O(n) algorithm for the 1‐median problem on trees. Mirchandani and Oudjit proved localization properties for 2‐medians on trees; these were later used to obtain an O(nlg n) bound, and, in special cases

    更新日期:2020-09-21
  • Parameter estimation in a 3‐parameter p‐star random graph model
    Networks (IF 2.602) Pub Date : 2020-09-18
    Pietro Lenarda; Giorgio Gnecco; Massimo Riccaboni

    An important issue in social network analysis refers to the development of algorithms for estimating parameters of a social network model, using data available from the network itself. This entails solving an optimization problem. In the paper, we propose a new method for parameter estimation in a specific social network model, namely, the so‐called p‐star random graph model with three parameters.

    更新日期:2020-09-20
  • Weighted target set selection on trees and cycles
    Networks (IF 2.602) Pub Date : 2020-09-10
    S. Raghavan; Rui Zhang

    There is significant interest in understanding the dynamics of influence diffusion on a social network. The weighted target set selection (WTSS) problem is a fundamental viral marketing problem arising on social networks. In this problem, the goal is to select a set of influential nodes to target (e.g., for promoting a new product) that can influence the rest of the network. The WTSS problem is APX‐hard

    更新日期:2020-09-10
  • Minimum color‐degree perfect b‐matchings
    Networks (IF 2.602) Pub Date : 2020-09-10
    Mariia Anapolska; Christina Büsing; Martin Comis; Tabea Krabs

    The minimum color‐degree perfect b‐matching problem (Col‐BM) is a new extension of the perfect b‐matching problem to edge‐colored graphs. The objective of Col‐BM is to minimize the maximum number of differently colored edges in a perfect b‐matching that are incident to the same node. We show that Col‐BM is ‐hard on bipartite graphs by a reduction from (3,B2)‐Sat, and conclude that there exists no

    更新日期:2020-09-10
  • Large‐scale zone‐based evacuation planning, Part II: Macroscopic and microscopic evaluations
    Networks (IF 2.602) Pub Date : 2020-09-07
    Mohd. Hafiz Hasan; Pascal Van Hentenryck

    A companion paper introduces models and algorithms for large‐scale zone‐based evacuation planning in which each evacuation zone is assigned a path to safety and a departure time. It also shows how to combine zone‐based evacuations with contraflows and impose additional path‐convergence and nonpreemptive constraints. This paper evaluates these algorithms on a real, large‐scale case study, both from

    更新日期:2020-09-09
  • Applications and efficient algorithms for integer programming problems on monotone constraints
    Networks (IF 2.602) Pub Date : 2020-09-09
    Dorit S. Hochbaum

    We present here classes of integer programming problems that are solvable efficiently and with combinatorial flow algorithms. The problems are characterized by constraints that have either at most two variables per inequality that appear with opposite sign coefficients, or have in addition a third variable that appears only in one constraint. Such integer programs, referred to here as monotone IP2

    更新日期:2020-09-09
  • Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
    Networks (IF 2.602) Pub Date : 2020-09-07
    Mohd. Hafiz Hasan; Pascal Van Hentenryck

    In zone‐based evacuation planning, the region to evacuate is divided into zones, and each zone must be assigned a path to safety and departure times along the path. Zone‐based evacuations are highly desirable in practice because they allow emergency services to communicate evacuation orders and to control the evacuation more precisely. Zone‐based evacuations may also be combined with contraflows (to

    更新日期:2020-09-07
  • Future directions in drone routing research
    Networks (IF 2.602) Pub Date : 2020-09-07
    Stefan Poikonen; James F. Campbell

    Optimization of routing problems using drones (unmanned aerial vehicles or UAVs) has become an important area of academic research. The purpose of this article is to look to the future and help stimulate drone routing research in directions we hope will prove interesting and fruitful. We discuss opportunities for better modeling of (1) drone capabilities for both existing drones and those likely to

    更新日期:2020-09-07
  • Most reliable two‐terminal graphs with node failures
    Networks (IF 2.602) Pub Date : 2020-07-26
    Isaac Brown; Christina Graves; Brendan Miller; Tyler Russell

    A two‐terminal graph is an undirected graph with two specified target vertices. If each nontarget vertex of a two‐terminal graph fails independently with the same fixed probability (and edges and target vertices are perfectly reliable), the two‐terminal node reliability is the probability that the target vertices are in the same connected component in the induced subgraph of all operational nodes.

    更新日期:2020-09-03
  • On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems
    Networks (IF 2.602) Pub Date : 2020-08-30
    Alexsander A. de Melo; Celina M. H. de Figueiredo; Uéverton dos Santos Souza

    Even, Itai, and Shamir (1976) proved simple two‐commodity integral flow is NP‐complete both in the directed and undirected cases. In particular, the directed case was shown to be NP‐complete even if one demand is unitary, which was improved by Fortune, Hopcroft and Wyllie (1980) who proved the problem is still NP‐complete if both demands are unitary. The undirected case, on the other hand, was proved

    更新日期:2020-08-31
  • The firebreak problem
    Networks (IF 2.602) Pub Date : 2020-08-21
    Kathleen D. Barnetson; Andrea C. Burgess; Jessica Enright; Jared Howell; David A. Pike; Brady Ryan

    Suppose we have a network that is represented by a graph G. Potentially a fire (or other type of contagion) might erupt at some vertex of G. We are able to respond to this outbreak by establishing a firebreak at k other vertices of G, so that the fire cannot pass through these fortified vertices. The question that now arises is which k vertices will result in the greatest number of vertices being saved

    更新日期:2020-08-22
  • Tangle bases: Revisited
    Networks (IF 2.602) Pub Date : 2020-08-21
    Illya V. Hicks; Boris Brimkov

    The concept of branch decomposition was first introduced by Robertson and Seymour in their proof of the Graph Minors Theorem, and can be seen as a measure of the global connectivity of a graph. Since then, branch decomposition and branchwidth have been used for computationally solving combinatorial optimization problems modeled on graphs and matroids. General branchwidth is the extension of branchwidth

    更新日期:2020-08-21
  • Network reliability: Heading out on the highway
    Networks (IF 2.602) Pub Date : 2020-08-14
    Jason I. Brown; Charles J. Colbourn; Danielle Cox; Christina Graves; Lucas Mol

    A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as diverse as combinatorics and graph theory, combinatorial enumeration, optimization, probability theory

    更新日期:2020-08-14
  • Fixed interval scheduling with third‐party machines
    Networks (IF 2.602) Pub Date : 2020-08-08
    Ilia Fridman; Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov

    We study a problem of scheduling n jobs on machines of two types: in‐house machines and third‐party machines. Scheduling on in‐house machines incurs no additional costs, while using third‐party machines implies costs depending on their number and the time of usage. Each job has a fixed time interval for being processed which can be divided and allocated among several machines, as long as there is only

    更新日期:2020-08-09
  • An exact bidirectional pulse algorithm for the constrained shortest path
    Networks (IF 2.602) Pub Date : 2020-06-21
    Nicolás Cabrera; Andrés L. Medaglia; Leonardo Lozano; Daniel Duque

    A constrained shortest path is a minimum‐cost sequence of arcs on a directed network that satisfies knapsack‐type constraints on the resource consumption over the arcs. We propose an exact method based on a recursive depth‐first search procedure known as the pulse algorithm (PA). One of the key contributions of the proposal lies in a bidirectional search strategy leveraged on parallelism. In addition

    更新日期:2020-08-05
  • Integrating production scheduling and transportation procurement through combinatorial auctions
    Networks (IF 2.602) Pub Date : 2020-07-14
    Chefi Triki; Sujan Piya; Liang‐Liang Fu

    This study uses the winner determination problem (WDP) to integrate auction transportation procurement with decisions related to production scheduling. The basic problem arises when a manufacturer has to clear a combinatorial auction to decide whether to cover transportation needs by using the in‐house fleet or to procure transportation through auction. Thus, the manufacturer should include an additional

    更新日期:2020-08-05
  • A branch‐and‐cut approach and alternative formulations for the traveling salesman problem with drone
    Networks (IF 2.602) Pub Date : 2020-06-22
    Daniel Schermer; Mahdi Moeini; Oliver Wendt

    In this paper, we are interested in studying the traveling salesman problem with drone (TSP‐D). Given a set of customers and a truck that is equipped with a single drone, the TSP‐D asks that all customers are served exactly once and minimal delivery time is achieved. We provide two compact mixed integer linear programming formulations that can be used to address instances with up to 10 customer within

    更新日期:2020-08-05
  • Routing electric vehicles with a single recharge per route
    Networks (IF 2.602) Pub Date : 2020-06-25
    Maximilian Löffler; Guy Desaulniers; Stefan Irnich; Michael Schneider

    Driven by environmental considerations, regulations on vehicle emissions, and the offer of major subsidies, electric commercial vehicles (ECVs) are receiving ever stronger attention in logistics companies. Route planning for ECV fleets requires consideration of the special characteristics of ECVs, like limited driving range and the potential need to recharge en route at dedicated recharging stations

    更新日期:2020-08-05
  • Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
    Networks (IF 2.602) Pub Date : 2020-07-21
    Zhiyuan Lin; Raymond S. K. Kwan

    Resource flows may merge and demerge at a network node. Sometimes several demerged flows may be immediately merged again, but in different combinations compared to before they were demerged. However, the demerging is unnecessary in the first place if the total resources at each of the network nodes involved remains unchanged. We describe this situation as “unnecessary demerging and remerging (UDR)”

    更新日期:2020-08-05
  • Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers
    Networks (IF 2.602) Pub Date : 2020-07-10
    Afonso Sampaio; Martin Savelsbergh; Lucas P. Veelenturf; Tom Van Woensel

    Rapid urban growth, the increasing importance of e‐commerce and high consumer service expectations have given rise to new and innovative models for freight delivery within urban environments. Crowdsourced solutions—where drivers are not employed by a carrier but occasionally offer their services through on‐line platforms and are contracted as required by carriers—are receiving growing attention from

    更新日期:2020-08-05
  • Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem
    Networks (IF 2.602) Pub Date : 2020-06-22
    Benjamin Graf

    The VeRoLog Solver Challenge 2018–2019 of the EURO working group vehicle routing and logistics (VeRoLog) considers a multiperiod vehicle and technician routing and scheduling problem. This paper proposes a combination of large neighborhood and local search heuristics and a decomposition approach to efficiently generate competitive solutions under restricted computational resources. The interplay of

    更新日期:2020-08-05
  • Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019
    Networks (IF 2.602) Pub Date : 2020-06-20
    Caroline J. Jagtenberg; Oliver J. Maclaren; Andrew J. Mason; Andrea Raith; Kevin Shen; Michael Sundvick

    This article reports on an approach for the VeRoLog Solver Challenge 2019: the fourth solver challenge facilitated by VeRoLog, the EURO Working Group on Vehicle Routing and Logistics Optimization. The authors were awarded third place in this challenge. The routing challenge involved solving two interlinked vehicle routing problems for equipment: one for distribution (using trucks) and one for installation

    更新日期:2020-08-05
  • Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
    Networks (IF 2.602) Pub Date : 2020-06-29
    Ahmed Kheiri; Leena Ahmed; Burak Boyacı; Joaquim Gromicho; Christine Mumford; Ender Özcan; Ali Selim Dirikoç

    This work tackles a rich vehicle routing problem (VRP) problem integrating a capacitated vehicle routing problem with time windows (CVRPTW), and a service technician routing and scheduling problem (STRSP) for delivering various equipment based on customers' requests, and the subsequent installation by a number of technicians. The main objective is to reduce the overall costs of hired resources, and

    更新日期:2020-08-05
  • Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator
    Networks (IF 2.602) Pub Date : 2020-07-25
    Adrien Cambier; Matthieu Chardy; Rosa Figueiredo; Adam Ouorou; Michael Poss

    We consider the context of a telecommunication company that is at the same time an infrastructure operator and a service provider. When planning its network expansion, the company can leverage over its knowledge of the subscriber dynamic to better optimize the network dimensioning, therefore avoiding unnecessary costs. In this work, the network expansion represents the deployment and/or reinforcement

    更新日期:2020-07-25
  • A novel pseudo‐polynomial approach for shortest paths problems
    Networks (IF 2.602) Pub Date : 2020-07-14
    Milos Danilovic; Dragan Vasiljevic; Biljana Cvetic

    This article presents a novel shortest‐paths algorithm for connected networks with non‐negative edge weights. The worst case running time of the Single Source Shortest Path version of the algorithm is O (max(m , )) where m is the number of edges of the input network, and , the normalized eccentricity of the source vertex. The pseudo‐polynomial nature of the time dependence is overcome with simple speed‐up

    更新日期:2020-07-14
  • Arc routing problems: A review of the past, present, and future
    Networks (IF 2.602) Pub Date : 2020-06-29
    Ángel Corberán; Richard Eglese; Geir Hasle; Isaac Plana; José María Sanchis

    Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from

    更新日期:2020-06-29
  • Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)
    Networks (IF 2.602) Pub Date : 2020-06-10
    Sara Bourbour; Dinesh P. Mehta; William C. Navidi

    We consider the network analytics problem of comparing two distance metrics on the same set of n entities. The classical solution to this problem is the Mantel test, which uses permutation testing to accept or reject the null hypothesis that there is “no relationship between the two metrics.” Its computational complexity is n2 times the number of permutations (based on a user supplied parameter). This

    更新日期:2020-06-10
  • The stochastic critical node problem over trees
    Networks (IF 2.602) Pub Date : 2020-05-29
    Pierre Hosteins; Rosario Scatamacchia

    We tackle a stochastic version of the critical node problem (CNP) where the goal is to minimize the pairwise connectivity of a graph by attacking a subset of its nodes. In the stochastic setting considered, the outcome of attacks on nodes is uncertain. In our work, we focus on trees and demonstrate that over trees the stochastic CNP actually generalizes to the stochastic critical element detection

    更新日期:2020-05-29
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
微生物研究
亚洲大洋洲地球科学
NPJ欢迎投稿
自然科研论文编辑
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
上海中医药大学
浙江大学
西湖大学
化学所
北京大学
清华
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
清华大学-1
武汉大学
浙江大学
天合科研
x-mol收录
试剂库存
down
wechat
bug