Remember Me
Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
García Villoria, Alberto; Salhi, Said (2015)
Publisher: Taylor & Francis
Languages: English
Types: Article
Subjects: Heuristic algorithms, Television commercials., Publicitat per televisió, H1, HA33, advertising, mathematical programming, Heurística, :Economia i organització d'empreses [Àrees temàtiques de la UPC], Programming (Mathematics), optimisation, heuristics, scheduling, Programació (Matemàtica)
The problem of scheduling the commercial advertisements in the television industry is investigated. Each advertiser client demands that the multiple airings of the same brand advertisement should be as spaced as possible over a given time period. Moreover, audience rating requests have to be taken into account in the scheduling. This is the first time this hard decision problem is dealt with in the literature. We design two mixed integer linear programming (MILP) models. Two constructive heuristics, local search procedures and simulated annealing (SA) approaches are also proposed. Extensive computational experiments, using several instances of various sizes, are performed. The results show that the proposed MILP model which represents the problem as a network flow obtains a larger number of optimal solutions and the best non-exact procedure is the one that uses SA.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Dowsland, K.A. and AdensoInteligencia Artificial, Vol. 19, pp. 93-102.
    • Eiben, A.E., Hinterding, R., and Michalewicz, Z. (1999) IEEE Transactions on Evolutionary Computation, Vol. 3, pp.
    • Feo, T.A. and Resende, M.G.C. (1989) Operations Research Letters, Vol. 8, pp. 67-81.
    • Fleming, P.J. and Pashkevich, M.A. (2007) IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews, Vol. 37, pp. 1190-1201.
    • García-Villoria, A., Salhi, S., Corominas, A. and Pastor, R. (201 Hyper-heuristic approaches for the response time variability problem European Journal of Operational Research, Vol. 211, pp. 160-169.
    • Garcíasolution of the response time vari Production Research, Vol. 51, pp. 4911-4920.
    • Journal of Scheduling, Vol. 16, pp. 243-252.
    • Gaur, D.R., Krishnamurti, R. and Kohli, R. (2009) `Conflict resolution in the scheduling Operations Research, Vol. 57, pp. 1098-1105.
    • Ghassemi-Tari, F. and Alaei, R. (2013) `Scheduling TV commercials using genetic International Journal of Production Research, Vol. 51, pp. 4921-4929.
    • Henderson, D., Jacobson, S.H. and Johnson, A.W. (2003) Handbook of Metaheuristics, Eds. Glover and Kochenberger, Kluwer Academic Publishers.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok