Search results for " optimization."
showing 10 items of 2333 documents
An advanced pavement management system based on a genetic algorithm for a motorway network
2013
Maintenance and improvement, through the rehabilitation, of the road infrastructure is a strategic and priority objective for road agencies, nevertheless the economic resources required are often inadequate. Within road management, the pavement management system (PMS) plays an essential role because of both the money needed and the performance that should be provided in terms of safety, ride quality and transport cost. The PMS is based on searching for a balanced solution between the lowest cost and the increased level of performance (i.e. pavement condition). In this paper a PMS multi-objective optimization method, was proposed, using a genetic algorithm (GA) to identify the best solution …
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
2015
International audience; Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
2018
In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into ac…
Seed Activation Scheduling for Influence Maximization in Social Networks
2018
This paper addresses the challenge of strategically maximizing the influence spread in a social network, by exploiting cascade propagators termed “seeds”. It introduces the Seed Activation Scheduling Problem (SASP) that chooses the timing of seed activation under a given budget, over a given time horizon, in the presence/absence of competition. The SASP is framed as a blogger-centric marketing problem on a two-level network, where the decisions are made to buy sponsored posts from prominent bloggers at calculated points in time. A Bayesian evidence diffusion model – the Partial Parallel Cascade (PPC) model – allows the network nodes to be partially activated, proportional to their accumulat…
On risk sensitive control of regular step Markov processes
2001
A Study of Nash-Evolutionary Algorithms for Reconstruction Inverse Problems in Structural Engineering
2014
In this paper we deal with solving inverse problems in structural engineering (both the reconstruction inverse problem and the fully stressed design problem are considered). We apply a game-theory based Nash-evolutionary algorithm and compare it with the standard panmictic evolutionary algorithm. The procedure performance is analyzed on a ten bar sized test case of discrete real cross-section types structural frame, where a significant increase of performance is achieved using the Nash approach, even achieving super-linear speed-up.
A Boundary Control Approach to an Optimal Shape Design Problem
1989
Abstract We consider the problem of controlling the coincidence set in connection with an obstacle problem. We shall transform the obtained optimal shape design problem into a boundary control problem with Dirichlet boundary conditions.
Branch-and-Bound
2010
We now turn to the discussion of how to solve the linear ordering problem to (proven) optimality. In this chapter we start with the branch-and-bound method which is a general procedure for solving combinatorial optimization problems. In the subsequent chapters this approach will be realized in a special way leading to the so-called branch-and-cut method. There are further possibilities for solving the LOP exactly, e.g. by formulating it as dynamic program or as quadratic assignment problem, but these approaches did not lead to the implementation of practical algorithms and we will not elaborate on them here.
Nash Equilibrium in a Road Network with Many Groups of Users
2019
In this chapter concentrates on the relationships between individual and group behaviour of drivers in a road network. Such relationships are established by comparing the optimal routing of drivers (system optimum of Wardrop), the competitive drivers’ groups routing (Nash equilibrium), and the selfish drivers routing (user equilibrium of Wardrop). Thus, the boundary conditions for traffic assignment in a road network were recently obtained for the first time. Wide analytical discussion on the topic as well as a survey of relevant references are presented. Moreover, a new behavioural model of traffic assignment in case of simultaneous selfish and group behaviour of drivers in a road network …