On green routing and scheduling problem

The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

Optimizing agents with genetic programming : an evaluation of hyper-heuristics in dynamic real-time logistics

Dynamic pickup and delivery problems (PDPs) require online algorithms for managing a fleet of vehicles. Generally, vehicles can be managed either centrally or decentrally. A common way to coordinate agents decentrally is to use the contract-net protocol (CNET) that uses auctions to allocate tasks among agents. To participate in an auction, agents require a method that estimates the value of a task. Typically this method is an optimization algorithm. Recently, hyper-heuristics has been proposed for automated design of heuristics. Two properties of automatically designed heuristics are particularly promising: 1) a generated heuristic computes quickly, it is expected therefore that hyper-heuristics heuristics perform especially well for urgent problems, and 2) by using simulationbased evaluation, hyper-heuristics can learn from the past and can therefore create a ‘rule of thumb’ that anticipates situations in the future. In the present paper we empirically evaluate whether hyper-heuristics, more specifically genetic programming (GP), can be used to improve agents decentrally coordinated via CNET. We compare several GP settings and compare the resulting heuristic with existing centralized and decentralized algorithms on a dynamic PDP dataset with varying levels of dynamism, urgency, and scale. The results indicate that the evolved heuristic always outperforms the optimization algorithm in the decentralized MAS and often outperforms the centralized optimization algorithm. Our paper shows that designing MASs using genetic programming is an effective way to obtain competitive performance compared to traditional operational research approaches. These results strengthen the relevance of decentralized agent based approaches in dynamic logistics

An MINLP model to support the movement and storage decisions of the Indian food grain supply chain

This paper addresses the novel three stage food grain distribution problem of Public Distribution System (PDS) in India which comprises of farmers, procurement centers, base silos and field silos. The Indian food grain supply chain consists of various activities such as procurement, storage, transportation and distribution of food grain. In order to curb transportation and storage losses of food grain, the Food Corporation of India (FCI) is moving towards the modernized bulk food grain supply chain system. This paper develops a Mixed Integer Non-Linear Programming (MINLP) model for planning the movement and storage of food grain from surplus states to deficit states considering the seasonal procurement, silo capacity, demand satisfaction and vehicle capacity constraints. The objective function of the model seeks to minimize the bulk food grain transportation, inventory holding, and operational cost. Therein, shipment cost contains the fixed and variable cost, inventory holding and operational cost considered at the procurement centers and base silos. The developed mathematical model is computationally complex in nature due to nonlinearity, the presence of numerous binary and integer variables along with a huge number of constraints, thus, it is very difficult to solve it using exact methods. Therefore, recently developed, Hybrid Particle-Chemical Reaction Optimization (HP-CRO) algorithm has been employed to solve the MINLP model. Different problem instances with growing complexities are solved using HP-CRO and the results are compared with basic Chemical Reaction Optimization (CRO) and Particle Swarm Optimization (PSO) algorithms. The results of computational experiments illustrate that the HP-CRO algorithm is competent enough to obtain the better quality solutions within reasonable computational time

Evaluation Of Lane Use Management Strategies

The limited funding available for roadway capacity expansion and the growing funding gap, in conjunction with the increasing congestion, creates a critical need for innovative lane use management options. Various cost-effective lane use management strategies have been implemented in the United States and worldwide to address these challenges. However, these strategies have their own costs, operational characteristics, and additional requirements for field deployment. Hence, there is a need for systematic methodologies to evaluate lane use management strategies. In this thesis, a systematic simulation-based methodology is proposed to evaluate lane use management strategies. It involves identifying traffic corridors that are suitable for lane use management strategies, and analyzing the strategies in terms of performance and financial feasibility. The state of Indiana is used as a case study for this purpose, and a set of traffic corridors is identified. From among them, a 10-mile stretch of the I-65 corridor south of downtown Indianapolis is selected as the study corridor using traffic analysis. The demand volumes for the study area are determined using subarea analysis. The performance of the traffic corridor is evaluated using a microsimulation-based analysis for alleviating congestion using three strategies: reversible lanes, high occupancy vehicle (HOV) lanes and ramp metering. Furthermore, an economic evaluation of these strategies is performed to determine the financial feasibility of their implementation. Results from the simulation based analysis indicate that the reversible lanes and ramp metering strategies improve traffic conditions on the freeway in the major flow direction. Implementation of the HOV lane strategy results in improved traffic flow conditions on the HOV lanes but aggravated congestion on the general purpose lanes. The HOV lane strategy is found to be economically infeasible due to low HOV volume on these lanes. The reversible lane and ramp metering strategies are found to be economically feasible with positive net present values (NPV), with the NPV for the reversible lane strategy being the highest. While reversible lanes, HOV lanes and ramp metering strategies are effective in mitigating congestion by optimizing lane usage, they do not generate additional revenue required to reduce the funding deficit. Inadequate funds and worsening congestion have prompted federal, state and local planning agencies to explore and implement various congestion pricing strategies. In this context, the high occupancy toll (HOT) lanes strategy is explored here. Equity concerns associated with pricing schemes in transportation systems have garnered increased attention in the recent past. Income inequity potentially exists under the HOT strategy whereby higher-income travelers may reap the benefits of HOT lane facilities. An income-based multi-toll pricing approach is proposed for a single HOT lane facility in a network to simultaneously maximize the toll revenue and address the income equity concern, while ensuring a minimum level-of-service on the HOT lanes and that the toll prices do not exceed thresholds specified by a regulatory entity. The problem is modeled as a bi-level optimization formulation. The upper level model seeks to maximize revenue for the tolling authority subject to pre-specified upper bounds on toll prices. The lower level model solves for the stochastic user equilibrium solution based on commuters\u27 objective of minimizing their generalized travel costs. Due to the computational intractability of the bi-level formulation, an approximate agent-based solution approach is used to determine the toll prices by considering the tolling authority and commuters as agents. Results from numerical experiments indicate that a multi-toll pricing scheme is more equitable and can yield higher revenues compared to a single toll price scheme across all travelers

Comparative Analysis of Selection Hyper-Heuristics for Real-World Multi-Objective Optimization Problems

As exact algorithms are unfeasible to solve real optimization problems, due to their computational complexity, meta-heuristics are usually used to solve them. However, choosing a meta-heuristic to solve a particular optimization problem is a non-trivial task, and often requires a time-consuming trial and error process. Hyper-heuristics, which are heuristics to choose heuristics, have been proposed as a means to both simplify and improve algorithm selection or configuration for optimization problems. This paper novel presents a novel cross-domain evaluation for multi-objective optimization: we investigate how four state-of-the-art online hyper-heuristics with different characteristics perform in order to find solutions for eighteen real-world multi-objective optimization problems. These hyper-heuristics were designed in previous studies and tackle the algorithm selection problem from different perspectives: Election-Based, based on Reinforcement Learning and based on a mathematical function. All studied hyper-heuristics control a set of five Multi-Objective Evolutionary Algorithms (MOEAs) as Low-Level (meta-)Heuristics (LLHs) while finding solutions for the optimization problem. To our knowledge, this work is the first to deal conjointly with the following issues: (i) selection of meta-heuristics instead of simple operators (ii) focus on multi-objective optimization problems, (iii) experiments on real world problems and not just function benchmarks. In our experiments, we computed, for each algorithm execution, Hypervolume and IGD+ and compared the results considering the Kruskal–Wallis statistical test. Furthermore, we ranked all the tested algorithms considering three different Friedman Rankings to summarize the cross-domain analysis. Our results showed that hyper-heuristics have a better cross-domain performance than single meta-heuristics, which makes them excellent candidates for solving new multi-objective optimization problems

Optimizing Transportation Systems with Information Provision, Personalized Incentives and Driver Cooperation

Poor performance of the transportation systems has many detrimental effects such as higher travel times, increased travel costs, higher energy consumption, and greenhouse gas emissions, etc. This thesis optimizes the transportation systems by addressing the traffic congestion problem and climate change impact resulting from the inefficient operation of these systems. I first focus on the key player of the transportation systems e.g., human being/traveler, and model travelers\u27 route choice behavior with real-time information. In this study, I define looking-ahead behavior in route choice as a traveler\u27s taking into account future diversion possibilities enabled by real-time information in a network with random travel times. Subjects participated in route-choice experiments in a driving simulator as well a PC-based environment. Three types of maps in increasing levels of complexity and information availability are used. Aggregate data analysis shows that network complexity negatively affects subjects\u27 ratio of choosing the risky route given an experiment environment. Higher cognitive load in the driving simulator results in a higher level of risk aversion than in the PC-based environment for the simplest map. I specify and estimate a mixed logit model with two latent classes, looking-ahead and myopic, taking into account the panel effect. The estimated latent class membership function suggests that some subjects can look ahead while others are myopic in making their route choices, and drivers learn to look ahead over time. The experiment environment plays a role in the risk attitude of myopic subjects. A bias against information is found for subjects who look ahead, however, is not significant among myopic subjects. I then shift my focus to influencing the travel patterns of individual travelers to reduce the energy and environmental impacts of the transportation sector. I present the system optimization (SO) framework of Tripod, an integrated bi-level transportation management system aimed at maximizing energy savings of the multi-modal transportation systems. From the user\u27s perspective, Tripod is a smartphone app, accessed before performing trips. The app proposes a series of alternatives each with an amount of tokens which the user can later redeem for goods or services. The role of SO is to compute the optimized set of tokens associated to the available alternatives, in order to minimize the system-wide energy consumption, under a limited token budget. I present a method to solve this complex optimization problem and describe the system architecture, the multimodal simulation-based optimization model and the heuristic method for the on-line computation of the optimized token allocation. I then present the framework with the simulation results. Finally, I optimize the systems travel time by addressing the equity issue of congestion pricing. I propose an alternative approach to an equitable and Pareto-improving transportation systems based on cooperation among travelers assisted by defector penalty. Theoretical analysis shows the existence condition of the cooperative scheme for heterogeneous value of time (VOT) of travelers. I formulate a mathematical programming problem for the optimal cooperative scheme problem in a general network with Pareto-improving constraints and practical considerations on the length the cooperation cycle. I then conduct computational tests on a simple network and evaluate the solutions in terms of efficiency improvement (total system travel time) and equitability (Gini index)

The Translocal Event and the Polyrhythmic Diagram

This thesis identifies and analyses the key creative protocols in translocal performance practice, and ends with suggestions for new forms of transversal live and mediated performance practice, informed by theory. It argues that ontologies of emergence in dynamic systems nourish contemporary practice in the digital arts. Feedback in self-organised, recursive systems and organisms elicit change, and change transforms. The arguments trace concepts from chaos and complexity theory to virtual multiplicity, relationality, intuition and individuation (in the work of Bergson, Deleuze, Guattari, Simondon, Massumi, and other process theorists). It then examines the intersection of methodologies in philosophy, science and art and the radical contingencies implicit in the technicity of real-time, collaborative composition. Simultaneous forces or tendencies such as perception/memory, content/ expression and instinct/intellect produce composites (experience, meaning, and intuition- respectively) that affect the sensation of interplay. The translocal event is itself a diagram - an interstice between the forces of the local and the global, between the tendencies of the individual and the collective. The translocal is a point of reference for exploring the distribution of affect, parameters of control and emergent aesthetics. Translocal interplay, enabled by digital technologies and network protocols, is ontogenetic and autopoietic; diagrammatic and synaesthetic; intuitive and transductive. KeyWorx is a software application developed for realtime, distributed, multimodal media processing. As a technological tool created by artists, KeyWorx supports this intuitive type of creative experience: a real-time, translocal “jamming” that transduces the lived experience of a “biogram,” a synaesthetic hinge-dimension. The emerging aesthetics are processual – intuitive, diagrammatic and transversal