Search Results - "MONTEMANNI, R"

Steepest ant sense algorithm for parameter optimisation of multi-response processes based on taguchi design by Luangpaiboon, P., Boonhao, S., Montemanni, R.

“…Due to the continuous refinements in engineering operations, process parameters need to be optimised in order to improve the production quality. In this study…”
Get full text

Coupling ant colony systems with strong local searches by Gambardella, L.M., Montemanni, R., Weyland, D.

“…► Enhanced ant colony system, a variant of the ant colony system framework is proposed. ► The new framework provides a better integration with strong local…”
Get full text

Industrial Cluster Symbiosis Optimisation Based on Linear Programming by Jamal, J., Montemanni, R.

“…Industrial Symbiosis is a symbiotic relationship between dissimilar industries that is achieved by the flow of waste and byproducts as an output from one…”
Get full text

Ant colony system for a dynamic vehicle routing problem by MONTEMANNI, R, GAMBARDELLA, L. M, RIZZOLI, A. E, DONATI, A. V

Get full text

An exact algorithm for the robust shortest path problem with interval data by Montemanni, R., Gambardella, L.M.

“…The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact…”
Get full text

The Robust Traveling Salesman Problem with Interval Data by Montemanni, R, Barta, J, Mastrolilli, M, Gambardella, L. M

“…The traveling salesman problem is one of the most famous combinatorial optimization problems and has been intensively studied. Many extensions to the basic…”
Get full text

Tour Planning and Ride Matching for an Urban Social Carpooling Service by Jamal, J., Rizzoli, A.E., Montemanni, R., Huber, D.

“…SocialCar is a research project aiming at integrating carpooling with existing transportation systems in urban and peri-urban environments. The system, that…”
Get full text

A branch and bound algorithm for the robust spanning tree problem with interval data by Montemanni, R., Gambardella, L.M.

“…The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust…”
Get full text

Heuristic Algorithms for Constructing Binary Constant Weight Codes by Montemanni, R., Smith, D.H.

“…Constant weight binary codes are used in a number of applications. Constructions based on mathematical structure are known for many codes. However, heuristic…”
Get full text

A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks by Montemanni, R., Leggieri, V.

“…The Minimum Power Multicast Problem arises in wireless sensor networks and consists in assigning a transmission power to each node of a network in such a way…”
Get full text

A note on the article “A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem” by Montemanni, R., Gambardella, L.M.

“…In the paper Li et al. [A robust branch-and-cut approach for the minimum-energy symmetric network connectivity problem. Omega 2012;40:210–7] it is claimed that…”
Get full text

A heuristic manipulation technique for the sequential ordering problem by Montemanni, R., Smith, D.H., Gambardella, L.M.

“…The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is…”
Get full text

Exact algorithms for the minimum power symmetric connectivity problem in wireless networks by Montemanni, R., Gambardella, L.M.

“…In this paper we consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes are connected by…”
Get full text

A branch and bound algorithm for the robust shortest path problem with interval data by Montemanni, R., Gambardella, L.M., Donati, A.V.

“…Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust…”
Get full text

Aggregate Blending via Robust Linear Programming by Montemanni, R, Toklu, N. E, Toklu, Ş. Ç, Toklu, Y. C

“…Aggregate blending is a problem frequently encountered in the construction industry. In this article, it is shown that robust linear programming can be used to…”
Get full text

An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem by Montemanni, R., Moon, J.N.J., Smith, D.H.

“…A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-assignment problem is presented. For cellular problems, the algorithm can be…”
Get full text

Frequency assignment, multiple interference and binary constraints by Graham, J. S., Montemanni, R., Moon, J. N. J., Smith, D. H.

“…The most accurate approaches to frequency assignment problems minimize a cost function based on signal-to-interference ratios at points where reception is…”
Get full text

An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem by Montemanni, R., Smith, D.H., Allen, S.M.

“…Frequencies have to be assigned to transmitters whenever a radio network is established or modified. This is ideally done is a way which minimises interference…”
Get full text

An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference by Montemanni, R., Smith, D.H., Allen, S.M.

“…The frequency-assignment problem is concerned with the assignment of discrete channels to the transmitters of a radio network. Separation of the frequencies…”
Get full text

Pickup and delivery with lockers by Dell’Amico, M., Montemanni, R., Novellani, S.

“…We define a pickup and delivery routing problem with time windows that arises in last-mile delivery. A customer can be served either directly at home, by one…”
Get full text