Semi-obnoxious location models: a global optimization approach

In the last decades there has been an increasing interest in environmental topics. This interest has been reflected in modeling the location of obnoxious facilities, as shown by the important number of papers published in this field. However, a very common drawback of the existing literature is that, as soon as environmental aspects are taken into account, economical considerations (e.g. transportation costs) are ignored, leading to models with dubious practical interest. In this paper we take into account both the environmental impact and the transportation costs caused by the location of an obnoxious facility, and propose as solution method of the well-known BSSS, with a new bounding scheme which exploits the structure of the problem.Dirección General de Investigación Científica y Técnic

Three location tapas calling for CG sauce

Based on some recent modelling considerations in location theory we call for study of three CG constructs of Voronoi type that seem not to have been studied much before

Support vector machines for classification of input vectors with different metrics

In this paper, a generalization of support vector machines is explored where it is considered that input vectors have different ℓp norms for each class. It is proved that the optimization problem for binary classification by using the maximal margin principle with ℓp and ℓq norms only depends on the ℓp norm if 1 ≤ p ≤ q. Furthermore, the selection of a different bias in the classifier function is a consequence of the ℓq norm in this approach. Some commentaries on the most commonly used approaches of SVM are also given as particular cases

Toward Sustainability: Bike-Sharing Systems Design, Simulation and Management

The goal of this Special Issue is to discuss new challenges in the simulation and management problems of both traditional and innovative bike-sharing systems, to ultimately encourage the competitiveness and attractiveness of BSSs, and contribute to the further promotion of sustainable mobility. We have selected thirteen papers for publication in this Special Issue

Mathematical Optimization for Routing and Logistic Problems

In this thesis, we focus on mathematical optimization models and algorithms for solving routing and logistic problems. The first contribution regards a path and mission planning problem, called Carrier-Vehicle Traveling Salesman Problem (CVTSP), for a system of heterogeneous vehicles. A Mixed-Integer Second Order Conic Programming (MISOCP) model and a Benders-like enumeration algorithm are presented for solving CVTSP. The second work concerns a class of routing problems, referred to as Interceptor Vehicle Routing Problems (IVRPs). They generalize VRPs in the sense that target points are allowed to move from their initial location according to a known motion. We present a novel MISOCP formulation and a Branch-and-Price algorithm based on a Lagrangian Relaxation of the vehicle-assignment constraints. Other two contributions focus on waste flow management problems: the former considers a deterministic setting in which a Mixed-Integer Linear Programming (MILP) formulation is used as a Decision Support System for a real-world waste operator, whereas the latter deals with the uncertainty of the waste generation amounts by means of Two-Stage Multiperiod Stochastic Mixed-Integer Programming formulations. Finally, we give an overview on the optimization challenges arising in electric car-sharing systems, both at strategic and tactical planning level

Spatial-temporal domain charging optimization and charging scenario iteration for EV

Environmental problems have become increasingly serious around the world. With lower carbon emissions, Electric Vehicles (EVs) have been utilized on a large scale over the past few years. However, EVs are limited by battery capacity and require frequent charging. Currently, EVs suffer from long charging time and charging congestion. Therefore, EV charging optimization is vital to ensure drivers’ mobility. This study first presents a literature analysis of the current charging modes taxonomy to elucidate the advantages and disadvantages of different charging modes. In specific optimization, under plug-in charging mode, an Urgency First Charging (UFC) scheduling policy is proposed with collaborative optimization of the spatialtemporal domain. The UFC policy allows those EVs with charging urgency to get preempted charging services. As conventional plug-in charging mode is limited by the deployment of Charging Stations (CSs), this study further introduces and optimizes Vehicle-to-Vehicle (V2V) charging. This is aim to maximize the utilization of charging infrastructures and to balance the grid load. This proposed reservation-based V2V charging scheme optimizes pair matching of EVs based on minimized distance. Meanwhile, this V2V scheme allows more EVs get fully charged via minimized waiting time based parking lot allocation. Constrained by shortcomings (rigid location of CSs and slow charging power under V2V converters), a single charging mode can hardly meet a large number of parallel charging requests. Thus, this study further proposes a hybrid charging mode. This mode is to utilize the advantages of plug-in and V2V modes to alleviate the pressure on the grid. Finally, this study addresses the potential problems of EV charging with a view to further optimizing EV charging in subsequent studies

Geometric-based Optimization Algorithms for Cable Routing and Branching in Cluttered Environments

The need for designing lighter and more compact systems often leaves limited space for planning routes for the connectors that enable interactions among the system’s components. Finding optimal routes for these connectors in a densely populated environment left behind at the detail design stage has been a challenging problem for decades. A variety of deterministic as well as heuristic methods has been developed to address different instances of this problem. While the focus of the deterministic methods is primarily on the optimality of the final solution, the heuristics offer acceptable solutions, especially for such problems, in a reasonable amount of time without guaranteeing to find optimal solutions. This study is an attempt to furthering the efforts in deterministic optimization methods to tackle the routing problem in two and three dimensions by focusing on the optimality of final solutions. The objective of this research is twofold. First, a mathematical framework is proposed for the optimization of the layout of wiring connectors in planar cluttered environments. The problem looks at finding the optimal tree network that spans multiple components to be connected with the aim of minimizing the overall length of the connectors while maximizing their common length (for maintainability and traceability of connectors). The optimization problem is formulated as a bi-objective problem and two solution methods are proposed: (1) to solve for the optimal locations of a known number of breakouts (where the connectors branch out) using mixed-binary optimization and visibility notion and (2) to find the minimum length tree that spans multiple components of the system and generates the optimal layout using the previously-developed convex hull based routing. The computational performance of these methods in solving a variety of problems is further evaluated. Second, the problem of finding the shortest route connecting two given nodes in a 3D cluttered environment is considered and addressed through deterministically generating a graphical representation of the collision-free space and searching for the shortest path on the found graph. The method is tested on sample workspaces with scattered convex polyhedra and its computational performance is evaluated. The work demonstrates the NP-hardness aspect of the problem which becomes quickly intractable as added components or increase in facets are considered

Intelligent Transportation Related Complex Systems and Sensors

Building around innovative services related to different modes of transport and traffic management, intelligent transport systems (ITS) are being widely adopted worldwide to improve the efficiency and safety of the transportation system. They enable users to be better informed and make safer, more coordinated, and smarter decisions on the use of transport networks. Current ITSs are complex systems, made up of several components/sub-systems characterized by time-dependent interactions among themselves. Some examples of these transportation-related complex systems include: road traffic sensors, autonomous/automated cars, smart cities, smart sensors, virtual sensors, traffic control systems, smart roads, logistics systems, smart mobility systems, and many others that are emerging from niche areas. The efficient operation of these complex systems requires: i) efficient solutions to the issues of sensors/actuators used to capture and control the physical parameters of these systems, as well as the quality of data collected from these systems; ii) tackling complexities using simulations and analytical modelling techniques; and iii) applying optimization techniques to improve the performance of these systems. It includes twenty-four papers, which cover scientific concepts, frameworks, architectures and various other ideas on analytics, trends and applications of transportation-related data