Search

Your search keyword '"Coniglio, Stefano"' showing total 173 results
Start Over Author "Coniglio, Stefano"
173 results on '"Coniglio, Stefano"'

51. Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria

Author

Basilico, Nicola, Coniglio, Stefano, Gatti, Nicola, Marchesi, Alberto, Iliopoulos, Costas S., Pissis, Solon P., Puglisi, Simon J., and Raman, Rajeev

Subjects
TheoryofComputation_MISCELLANEOUS, Computer Science::Computer Science and Game Theory, Stackelberg games, Nash equilibria, Game theory, Bilevel and nonlinear programming, Branch-and-bound, 000 Computer science, knowledge, general works, Settore INF/01 - Informatica, 020209 energy, TheoryofComputation_GENERAL, 02 engineering and technology, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Settore MAT/09 - Ricerca Operativa
Abstract

We study the problem of computing an equilibrium in leader-follower games with a single leader and multiple followers where, after the leader’s commitment to a mixed strategy, the followers play simultaneously in a noncooperative way, reaching a Nash equilibrium. We tackle the problem from a bilevel programming perspective. Since, given the leader’s strategy, the followers’ subgame may admit multiple Nash equilibria, we consider the cases where the followers play either the best (optimistic) or the worst (pessimistic) Nash equilibrium in terms of the leader’s utility. For the optimistic case, we propose three formulations which cast the problem into a single level mixed-integer nonconvex program. For the pessimistic case, which, as we show, may admit a supremum but not a maximum, we develop an ad hoc branch-and-bound algorithm. Computational results are reported and illustrated.

Published
2017

52. On the separation of topology-free rank inequalities for the max stable set problem

Author

Coniglio, Stefano and Gualandi, Stefano

Subjects
050210 logistics & transportation, 021103 operations research, 000 Computer science, knowledge, general works, Settore INF/01 - Informatica, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, cutting planes, Maximum stable set problem, rank inequalities, integer programming, combinatorial optimization, 0502 economics and business, Computer Science, Settore MAT/09 - Ricerca Operativa
Abstract

In the context of finding the largest stable set of a graph, rank inequalities prescribe that a stable set can contain, from any induced subgraph of the original graph, at most as many vertices as the stability number of the former. Although these inequalities subsume many of the valid inequalities known for the problem, their exact separation has only been investigated in few special cases obtained by restricting the induced subgraph to a specific topology. In this work, we propose a different approach in which, rather than imposing topological restrictions on the induced subgraph, we assume the right-hand side of the inequality to be fixed to a given (but arbitrary) constant. We then study the arising separation problem, which corresponds to the problem of finding a maximum weight subgraph with a bounded stability number. After proving its hardness and giving some insights on its polyhedral structure, we propose an exact branch-and-cut method for its solution. Computational results show that the separation of topology-free rank inequalities with a fixed right-hand side yields a substantial improvement over the bound provided by the fractional clique polytope (which is obtained with rank inequalities where the induced subgraph is restricted to a clique), often better than that obtained with Lovász’s Theta function via semidefinite programming.

Published
2017

53. Towards the physical internet paradigm: A model for transportation planning in complex road networks with empty return optimization

Author

Caballini, Claudia, Paolucci, Massimo, Sacone, Simona, Ursavas, Evrim, Bektaş, Tolga, Coniglio, Stefano, Martinez-Sykora, Antonio, Voß, Stefan, and Research programme OPERA

Subjects
Truck, 0209 industrial biotechnology, Operations research, Computer science, Total cost, Physical Internet, Empty truck return, 02 engineering and technology, MIP optimization, Theoretical Computer Science, 020901 industrial engineering & automation, Consolidation (business), 0502 economics and business, Groupage, Physical internet, Road network, Social sustainability, Computer Science (all), Integer programming, Simulation, 050210 logistics & transportation, Transportation planning, 05 social sciences, Flow network, TRIPS architecture
Abstract

The Physical Internet paradigm is redesigning the logic of moving goods around the planet, with the goal of making logistics more effective, sustainable and efficient. In this paper a road transportation network devoted to the PI paradigm is designed, modeled and implemented. The problem deals with groupage transportation, including consolidation and deconsolidation centers in the network nodes where goods are loaded/unloaded in/out from containers. The goal is to serve the demand of some shipment orders belonging to different areas with the final goal of minimizing total costs, exploiting trucks capacity and reducing empty trips. A mixed integer linear programming (MILP) model is presented and an experimental analysis is provided. The results obtained have shown the effectiveness of the approach proposed.

Published
2017

54. Integrating Fleet Deployment into the Liner Shipping Cargo Allocation Problem

Author

Müller, Daniel, Guericke, Stefan, Tierney, Kevin, Bektaş, Tolga, Coniglio, Stefano, Martinez-Sykora, Antonio, and Voß, Stefan

Subjects
050210 logistics & transportation, Service (systems architecture), 021103 operations research, Operations research, Computer science, Network on, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, Software deployment, 0502 economics and business, Profitability index, Computational analysis, Integer programming, Liner shipping
Abstract

Liner carriers change their network on a regular basis, and they are therefore interested in a practical evaluation of the impact these changes have on the cargo flows in their networks. Despite great advancements in the practical applicability of network evaluators in recent years, vessel deployment continues to be considered as an input into the problem, rather than a decision. In this paper, we propose an extension of a state-of-the-art mixed integer programming model for the LSCAP that incorporates the optimization of vessel count and vessel classes for each service. We perform a computational analysis on liner shipping networks of different sizes and compare our optimized results to fixed deployment scenarios. By integrating fleet deployment decisions into the cargo allocation problem, liner carriers can increase the profitability of their networks by at least 2.8 to 16.9% and greatly enhance their decision making.

Published
2017

67. Network Optimization Problems Subject to Max-Min Fair Flow Allocation.

Author

Amaldi, Edoardo, Capone, Antonio, Coniglio, Stefano, and Gianoli, Luca G.

Abstract

We propose a novel way to consider the max-min fairness (MMF) paradigm in traffic engineering. Since MMF appears as a reference model for a fair capacity allocation when the traffic flows are elastic and rates are adapted based on resource availability, we consider it as a requirement due to the way resources are shared by the distributed rate control scheme (like that of the transport protocol), rather than the routing objective. In particular, we define the traffic engineering problem where, given a network topology with link capacities and a set of elastic traffic demands to route, we must select a single path for each demand so as to maximize a network utility function, assuming an MMF bandwidth allocation. We propose a compact mixed-integer linear programming formulation as well as a restricted path formulation. We show with computational experiments that the exact formulation can be solved in a reasonable amount of computing time for medium-size networks and that the restricted path model provides solutions of comparable quality much faster. [ABSTRACT FROM PUBLISHER]

Published
2013
Full Text
View/download PDF

68. Optimizing supervised machine learning algorithms with practical applications

Author

Dunn, Anthony James, Zemkoho, Alain, Coniglio, Stefano, and Qi, Hou-Duo

Abstract

Machine learning (ML) and artificial intelligence (AI) are rapidly growing fields with applications in many scientific domains. In this work we focus on supervised learning algorithms for prediction tasks in practical applications. Specifically, we focus on two applications, predicting adverse events in low-carbon energy production and screening patients' eligibility for implantable defibrillators. We present optimised pre-processing methods, optimise hyperparameter selections and present our own bilevel optimisation model for simultaneous training and hyperparameter tuning. We first consider the problem of predicting infrequently occurring adverse events from time series data (Provided by Andigestion Ltd, a UK-based anaerobic digestion company, and a civil nuclear power plant in the UK) for which we propose a framework for modelling this problem as an imbalanced classification task and we construct and compare numerous models and sampling techniques. The models developed here could be integrated into a decision support tool for providing advanced warning of adverse events which can lead to significant commercial benefits. We then propose an AI tool for automated, prolonged screening of patients' implantable defibrillator eligibility which is created using real ECG data provided by our partners at the University Hospital Southampton. As we demonstrate in our experiments, this tool is capable of predicting patients' T:R ratios (a major indication of implantation eligibility) to within 0.0461 of their true values. This level of accuracy is sufficient to facilitate the automation of the measurement process. We show how this tool can enable cardiologists to perform 24-hour automated screenings, thus allowing them to better determine patients' eligibility for implantation. Finally, we formulate the bilevel problem of hyperparameter selection for non-linear kernel support vector machines via k-fold cross validation and propose an algorithm for solving it, for which we demonstrate some convergence properties. We provide a number of examples of this algorithm in use on a number of real data sets from the UCI repository.

Published
2023

70. Robust optimization technique for hydropower production

Author

Badrodin, Jamaliatul Badriyah, Coniglio, Stefano, and Qi, Hou-Duo

Abstract

The aim of this thesis is to propose efficient methods for scheduling a long-term hy- dropower production. Managing hydropower is challenging, as it consists of various variables and constraints. The hydropower studied here consist of storage water, re- lease water, and pumping storage. Moreover, uncertainty regarding the amount of inflow water to the reservoir makes the problem more difficult. Therefore, it is essen- tial to model the problem which taking into account the uncertainty in the problem. Consequently, We model the problem using Robust Optimization (RO) and Stochastic Dynamic Programming (SDP) and compare the results. The result shows that RO per- forms better than SDP. Hence, we focus on solely using the RO model for the rest of the research. We also investigate two types of decision making, namely risk averse and risk-neutral, then capture their behaviour in our model. Because of the uncertainty regarding inflow water, we want our decision to be able to adapt to any realisation of inflow. Therefore, we define the decision variables as an affine function of inflow water. These decision variables depend on a series of τ of inflow, where τ is the time window of how far we look back into the history of inflow. The result shows that an increase in τ causes an improvement in the result in training set. However, it is shown that there stops being an improvement at some point of τ and that too large of τ causes a degradation in the quality of the result when it is applied to validation set. The phenomenon of the decreasing quality of result in validation set when τ is increas- ing prove that there is an overfitting on the model. Therefore, we add a regularisation to the model to prevent the overfitting. We add the constraints to restrict that the amount inflow water today give more effect to the decision on how much water should be re- leased today rather than the amount of inflow water yesterday. Adding this constraints to the model improves the quality of the solution in the validation set. Furthermore, we add the spill variable to the problem. This variable is bounded by a function called as evacuation curve. The evacuation curve is a function of the max- imum amount of water to be spilled at specific level of storage at a specific time and scenario of inflow. This function is increasing and non-linear. However, we approxim- ate it to an affine function to keep the model linear. The numerical result suggests that the spill variable is not useful when the average water in the storage is not close to the maximum capacity. Finally, we add the waterhead variable to the model. Previously, the problem assumes that the waterhead is constant. However, in reality, the waterhead is not fixed and de- pends on the water level in the storage. The variable waterhead then is described as an affine function of storage variable. Thus, this converts the model to a non-linear and non-convex model. We combine this non linear model with a rolling horizon algorithm to solve the problem. We propose two rolling horizon algorithms: Simple Rolling hori- zon (SRH) and Dynamic Rolling Horizon (DRH). The result shows that considering the rolling horizon algorithms, SRH and DRH, leads to better revenue and shorter time to run than when the problem is solved in full time horizon at once. Moreover, compar- ing the result of the model considering waterhead and the linear model with constant waterhead, it is found that considering waterhead gives better revenue. Lastly, by com- paring two rolling horizon algorithms, it can be shown that DRH produces better result rather than SRH.

Published
2023

71. Vehicle routing and scheduling with synchronisation, time windows and skill levels with applications in lifeboat maintenance

Author

Walton, Ruth and Coniglio, Stefano

Abstract

The Vehicle Routing Problem (VRP) is one of the most widely studied problems in Operational Research, due both to its complexity and vast number of possible variations and applications. In this thesis we present one such variation of the VRP with synchronisation, time windows and skill levels, designed for the application in the routing of lifeboat maintenance technicians in the Royal National Lifeboat Institution (RNLI), the largest coastal lifesaving charity in the UK. These technicians work in one of several geographical divisions and complete a mixture of planned work, known up to six months in advance, and unplanned work in response to equipment fault and failure which may need to be completed within as little as 48 hours. The objective is to produce routes of minimum cost for these technicians such that all jobs are completed within their respective time window by a technician (or pair of technicians) with the appropriate skill level, and where jobs are completed by two technicians their routes are synchronised to enable them to work together on a job with minimal time spent waiting. The contributing costs include travel, nights away for technicians working far from home and the costs incurred through lateness of jobs. We formulate an integer program and propose a matheuristic algorithm, comprised of Lagrangian relaxation, brancn and bound and a local search heuristic, to solve the formulation at a divisional level across one or two weeks. We are able to prove that the iii subgradient method used with Lagrangian relaxation achieves a good lower bound after just one iteration, which provides an initial solution on which to base the local search heuristic used to find further improvements. We show that this approach achieves usable solutions within a number of minutes, a time which is sufficient for such a method to be implemented by those responsible for technician planning at the RNLI. Such short computation times also allow for the inclusion of unplanned jobs at short notice, as the problem can be resolved with the remaining jobs in a planning period to produce new routes.

Published
2021

72. A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Author

Stefano Coniglio, Fabio Furini, Pablo San Segundo, Ivana Ljubić, autre, AUTRES, University of Southampton - Mathematical Sciences, University of Southampton, Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), ESSEC Business School, Ecole Supérieure des Sciences Economiques et Commerciales, Ministerio de Ciencia, Innovación y Universidades (España), San Segundo, Pablo, Coniglio, Stefano, Furini, Fabio, Ljubić, Ivana, San Segundo, Pablo [0000-0001-7050-5563], Coniglio, Stefano [0000-0001-9568-4385], Furini, Fabio [0000-0002-1839-5827], and Ljubić, Ivana [0000-0002-4834-6284]

Subjects
Combinatorial optimization, Information Systems and Management, General Computer Science, Computer science, Branch-and-bound, 0211 other engineering and technologies, 02 engineering and technology, Management Science and Operations Research, Maximum edge-weighted clique problem, Industrial and Manufacturing Engineering, Combinatorics, Clique problem, 0502 economics and business, [INFO]Computer Science [cs], Pruning (decision trees), Clique, 050210 logistics & transportation, 021103 operations research, Settore INF/01 - Informatica, Branch and bound, 05 social sciences, Tree (graph theory), Graph, Range (mathematics), Modeling and Simulation, Settore MAT/09 - Ricerca Operativa, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range of applications, including bioinformatics, material science, computer vision, robotics, and many more. In this work, we propose a new combinatorial branch-and-bound algorithm for the problem which relies on a novel bounding procedure capable of pruning a very large amount of nodes of the branch-and-bound tree. Extensive computational experiments on random and structured graphs, encompassing standard benchmarks used in the literature as well as recently introduced real-world large-scale graphs, show that our new algorithm outperforms the state-of-the-art by several orders of magnitude on many instances., This work is partially funded by the Spanish Ministry of Science, Innovation and Universities through the project COGDRIVE (grant DPI2017-86915-C3-3-R). The authors would also like to thank S. Hosseinian for sharing the source code of the algorithm CBQ and for his collaboration when comparing our algorithm with CBQ.

Published
2019

73. A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts

Author

Stefano Coniglio, Fabio Furini, Pablo San Segundo, Ministerio de Ciencia, Innovación y Universidades (España), Coniglio, Stefano, Furini, Fabio, San Segundo, Pablo, Coniglio, Stefano [0000-0001-9568-4385], Furini, Fabio [0000-0002-1839-5827], and San Segundo, Pablo [0000-0001-7050-5563]

Subjects
Mathematical optimization, Information Systems and Management, Combinatorial optimization, General Computer Science, Linear programming, Computer science, Branch-and-bound algorithm, 0211 other engineering and technologies, 02 engineering and technology, Management Science and Operations Research, Upper and lower bounds, Industrial and Manufacturing Engineering, 0502 economics and business, Pruning (decision trees), Maximum Weighted Clique Problem, 050210 logistics & transportation, 021103 operations research, Knapsack Problem with Conflicts, Settore INF/01 - Informatica, Branch and bound, 05 social sciences, Solver, Tree (data structure), Knapsack problem, Modeling and Simulation, Maximal Clique Vertex Cover Problem Maximum Independent Set, Settore MAT/09 - Ricerca Operativa
Abstract

We study the Knapsack Problem with Conflicts, a generalization of the Knapsack Problem in which a set of conflicts specifies pairs of items which cannot be simultaneously selected. In this work, we propose a novel combinatorial branch-and-bound algorithm for this problem based on an n-ary branching scheme. Our algorithm effectively combines different procedures for pruning the branch-and-bound nodes based on different relaxations of the Knapsack Problem with Conflicts. Its main elements of novelty are: (i) the adoption of the branching-and-pruned set branching scheme which, while extensively used in the maximum-clique literature, was never successfully employed for solving the Knapsack Problem with Conflicts; (ii) the adoption of the Multiple-Choice Knapsack Problem for the derivation of upper bounds used for pruning the branch-and-bound tree nodes; and (iii) the design of a new upper bound for the latter problem which can be computed very efficiently. Key to our algorithm is its high pruning potential and the low computational effort that it requires to process each branch-and-bound node. An extensive set of experiments carried out on the benchmark instances typically used in the literature shows that, for edge densities ranging from 0.1 to 0.9, our algorithm is faster by up to two orders of magnitude than the state-of-the-art method and by up to several orders of magnitude than a state-of-the-art mixed-integer linear programming solver., This work has been partially funded by the Spanish Ministry of Science, Innovation and Universities through the project COGDRIVE (DPI2017-86915-C3-3-R).

Published
2020

74. Framework of Synchromodal Transportation Problems

Author

De Juncker, M. A. M., Huizing, D., del Vecchyo, M. R. Ortega, Phillipson, F., Sangers, A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

75. Agent-Based Simulation to Assess the Performance of Intersections with Pre-signals: Comparison with Roundabouts

Author

Vieira, António A. C., Dias, Luís M. S., Pereira, Guilherme A. B., Oliveira, José A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

76. Quality-Aware Modeling and Optimal Scheduling for Perishable Good Distribution Networks: The Case of Banana Logistics

Author

Lin, X., Negenborn, R. R., Duinkerken, M. B., Lodewijks, G., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

77. Efficient Local Search Heuristics for Packing Irregular Shapes in Two-Dimensional Heterogeneous Bins

Author

Abeysooriya, Ranga P., Bennell, Julia A., Martinez-Sykora, Antonio, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

78. Reducing Airport Emissions with Coordinated Pushback Processes: A Case Study

Author

Bubalo, Branko, Schulte, Frederik, Voß, Stefan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

79. A Dynamic Network Flow Model for Interdependent Infrastructure and Supply Chain Networks with Uncertain Asset Operability

Author

Goldbeck, Nils, Angeloudis, Panagiotis, Ochieng, Washington Y., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

80. Establishing Outsourcing and Supply Chain Plans for Prefabricated Construction Projects Under Uncertain Productivity

Author

Hsu, Pei-Yuan, Aurisicchio, Marco, Angeloudis, Panagiotis, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

81. Simulating Storage Policies for an Automated Grid-Based Warehouse System

Author

Beckschäfer, Michaela, Malberg, Simon, Tierney, Kevin, Weskamp, Christoph, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

82. A Shortest Path Heuristic for Evaluating the Quality of Stowage Plans in Roll-On Roll-Off Liner Shipping

Author

Hansen, Jone R., Fagerholt, Kjetil, Stålhane, Magnus, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

83. Optimising and Recognising 2-Stage Delivery Chains with Time Windows

Author

Phillipson, Frank, del Vecchyo, Max Ortega, van Ginkel, Bart, Huizing, Dylan, Sangers, Alex, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

84. Cost-Efficient Allocation of Bikes to Stations in Bike Sharing Systems

Author

Vogel, Patrick, Ehmke, Jan Fabian, Mattfeld, Dirk Christian, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

85. Survey on Characteristics and Challenges of Synchromodal Transportation in Global Cold Chains

Author

Guo, Wenjing, van Blokland, Wouter Beelaerts, Lodewijks, Gabriel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

86. Stochastic Programming for Global Supply Chain Planning Under Uncertainty: An Outline

Author

Fan, Yingjie, Schwartz, Frank, Voß, Stefan, Woodruff, David L., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

87. Survey on Autonomous Surface Vessels: Part II - Categorization of 60 Prototypes and Future Applications

Author

Schiaretti, Matteo, Chen, Linying, Negenborn, Rudy R., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

88. The Liner Shipping Routing and Scheduling Problem Under Environmental Considerations: The Case of Emissions Control Areas

Author

Dithmer, Philip, Reinhardt, Line, Kontovas, Christos A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

89. Vehicle Routing with a Heterogeneous Fleet of Combustion and Battery-Powered Electric Vehicles Under Energy Minimization

Author

Kopfer, Herbert, Vornhusen, Benedikt, Dethloff, Jan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

90. Strategic Optimization of Offshore Wind Farm Installation

Author

Backe, Stian, Haugland, Dag, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

91. A Relax-and-Fix Algorithm for a Maritime Inventory Routing Problem

Author

Friske, Marcelo W., Buriol, Luciana S., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

92. Review of Fuzzy Techniques in Maritime Shipping Operations

Author

Ries, Jana, González-Ramírez, Rosa G., Voß, Stefan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

93. Maritime Load Dependent Lead Times - An Analysis

Author

Pahl, Julia, Voß, Stefan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

94. A New Formulation for the Combined Maritime Fleet Deployment and Inventory Management Problem

Author

Dong, Bo, Bektaş, Tolga, Chandra, Saurabh, Christiansen, Marielle, Fagerholt, Kjetil, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

95. A Combinatorial Auction for Transportation Matching Service: Formulation and Adaptive Large Neighborhood Search Heuristic

Author

Li, Baoxiang, Lau, Hoong Chuin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

96. A Polyhedral Study of the Elementary Shortest Path Problem with Resource Constraints

Author

Da, Jiarui, Zheng, Lanbo, Tang, Xin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

97. Time-Dependent Route Planning for Truck Drivers

Author

Kleff, Alexander, Bräuer, Christian, Schulz, Frank, Buchhold, Valentin, Baum, Moritz, Wagner, Dorothea, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

98. Survey on Autonomous Surface Vessels: Part I - A New Detailed Definition of Autonomy Levels

Author

Schiaretti, Matteo, Chen, Linying, Negenborn, Rudy R., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

99. Maximizing the Number of Served Requests in an Online Shared Transport System by Solving a Dynamic DARP

Author

Vallée, Sven, Oulamara, Ammar, Cherif-Khettaf, Wahiba Ramdane, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

100. The Vehicle Routing Problem with Dynamic Occasional Drivers

Author

Dahle, Lars, Andersson, Henrik, Christiansen, Marielle, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bektaş, Tolga, editor, Coniglio, Stefano, editor, Martinez-Sykora, Antonio, editor, and Voß, Stefan, editor

Published
2017
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results